The K-sat problem in a simple limit
classification
❄️ cond-mat.dis-nn
cond-mat.stat-mech
keywords
limitalphahighproblempropertiesaccuracybreakingclauses
read the original 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, $\alpha > \alpha_c$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.