The K-sat problem in a simple limit
Disordered Systems and Neural Networks
2007-05-23 v2 Statistical Mechanics
Abstract
We 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, .
Keywords
Cite
@article{arxiv.cond-mat/0007364,
title = {The K-sat problem in a simple limit},
author = {L. Leuzzi and G. Parisi},
journal= {arXiv preprint arXiv:cond-mat/0007364},
year = {2007}
}
Comments
9 pages, 6 figures. To appear in J. Stat. Phys. Minor changes