The K-sat problem in a simple limit

Simple item page
dc.creatorLeuzzi, L.
dc.creatorParisi, G.
dc.date2000-07-24
dc.date2001-04-17
dc.date.accessioned2026-07-07T02:38:17Z
dc.date.available2026-07-07T02:38:17Z
dc.descriptionWe compute the thermodynamic properties of the 3-satisfiability problem in the infinite connectivity limit. In this limit the computations can be strongly simplified and the thermodynamical properties can be obtained with an high accuracy. We find evidence for a continuous replica symmetry breaking in the region of high number of clauses, $α> α_c$.
dc.description9 pages, 6 figures. To appear in J. Stat. Phys. Minor changes
dc.identifierhttps://arxiv.org/abs/cond-mat/0007364
dc.identifierhttp://arxiv.org/abs/cond-mat/0007364
dc.identifierJ STAT PHYS 103, 679-695 (2001)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/16615
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.titleThe K-sat problem in a simple limit
dc.typetext

Files

Collections

arXiv