The random $k$-SAT Gibbs uniqueness threshold revisited
By: Arnab Chatterjee , Amin Coja-Oghlan , Catherine Greenhill and more
Potential Business Impact:
Finds how many answers random puzzles have.
We prove that for any $k\geq3$ for clause/variable ratios up to the Gibbs uniqueness threshold of the corresponding Galton-Watson tree, the number of satisfying assignments of random $k$-SAT formulas is given by the `replica symmetric solution' predicted by physics methods [Monasson, Zecchina: Phys. Rev. Lett. (1996)]. Furthermore, while the Gibbs uniqueness threshold is still not known precisely for any $k\geq3$, we derive new lower bounds on this threshold that improve over prior work [Montanari and Shah: SODA (2007)].The improvement is significant particularly for small $k$.
Similar Papers
Symmetric Rule-Based Achlioptas Processes for Random $k$-SAT
Discrete Mathematics
Makes hard computer puzzles easier to solve.
On the Regularity of Random 2-SAT and 3-SAT
Probability
Finds how many clues are needed to solve puzzles.
SAT problem and Limit of Solomonoff's inductive reasoning theory
Computational Complexity
Helps understand how hard problems can be solved.