2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) (2016)
New Brunswick, New Jersey, USA
Oct. 9, 2016 to Oct. 11, 2016
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2016.82
Recent work has made substantial progress in understanding the transitions of random constraint satisfaction problems (CSPs). In particular, for several of these models, the exact satisfiability threshold has been rigorously determined, confirming predictions from the statistical physics literature. Here we revisit one of these models, random regular NAE-SAT: knowing the satisfiability threshold, it is natural to study, in the satisfiable regime, the number of solutions in a typical instance. We prove here that these solutions have a well-defined free energy (limiting exponential growth rate), with explicit value matching the one-step replica symmetry breaking prediction. The proof develops new techniques for analyzing a certain "survey propagation model" associated to this problem. We believe that these methods may be applicable in a wide class of related problems.
Physics, Probability, Predictive models, Analytical models, Computer science, Sun, Electronic mail
A. Sly, N. Sun and Y. Zhang, "The Number of Solutions for Random Regular NAE-SAT," 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), New Brunswick, New Jersey, USA, 2016, pp. 724-731.