Threshold values of random K-SAT from the cavity method

Random Structures and Algorithms

Volumn 28, Issue 3, 2006, Pages 340-373

  Mertens, Stephan ^a   Mézard, Marc ^b   Zecchina, Riccardo ^c  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b CNRS   (France)

^c ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL PHYSICS   (Italy)

Author keywords

Average Case Complexity; Cavity Approach; K SAT; Phase Transition; Satisfiability; Survey Propagation; Threshold Phenomenon

Indexed keywords

EID: 33646431437     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20090     Document Type: Article

References (35)

1. D. Achlioptas, Lower bounds for random 3-SAT via differential equations, Theoret Comput Sci 265 (2001), 159-185.
2. k log 2 - O(k), J Amer Math Soc 17(4) (2004), 947-973.
3. Heiko Bauke, TRNG - a portable random number generator for parallel computing, Otto von Guericke University, Magdeburg, Germany, http://tina.nat.uni-magdeburg.de/TRNG.
4. A. Braunstein, M. Mézard, and R. Zecchina, Survey propagation: An algorithm for satisfiability, http://arXiv.org/abs/cs.CC/0212002.
5. Alfredo Braunstein and Riccardo Zecchina, Survey propagation as local equilibrium equations, J Stat Mech Theory (2004), P06007.
6. S. A. Cook and D. G. Mitchell, "Finding hard instances of the satisfiability problem: A survey," Satisfiability Problem: Theory and Applications, Eds, D. Du, J. Gu, and P. M. Pardalos, Amer Math Soc, 1-17, Providence RI, 1997.
7. Stephen Cook, The complexity of theorem proving procedures, Proc Third Annu ACM Symp Theory of Computing, 1971, pp. 151-158.
8. O. Dubois and Y. Bouhkhad, A general upper bound for the satisfiability threshold of random r-SAT formulae, J Algorithms 24 (1997), 395-420.
9. O. Dubois, R. Monasson, B. Selman, and R. Zecchina, Eds., Phase Transitions in Combinatorial Problems, Theoret Comput Sci 265, 2001.
10. S. Franz and M. Leone, Replica bounds for optimization problems and diluted spin systems, J Stat Phys 111 (2003), 535.
11. E. Friedgut, Sharp thresholds of graph properties, and the k-SAT problem, J Amer Math Soc 12 (1999), 1017-1054.
12. A. M. Frieze and S. Suen, Analysis of two simple heuristics on a random instance of k-SAT, J Algorithms 20 (1996), 312-355.
13. M. R. Garey and D. S. Johnson, Computers and intractability. A guide to the theory of NP-completeness. Freeman, New York, 1997.
14. F. Guerra and F. L. Toninelli, The thermodynamic limit in mean field spin glass models, Comm Math Phys 230 (2002), 71.
15. T. Hogg, B. A. Huberman, and C. Williams, Eds., Frontiers in problem solving: phase transitions and complexity, Artificial Intelligence 81, 1996.
16. S. Kirkpatrick and B. Selman, Critical behavior in the satisfiability of random boolean expressions. Science, 264 (May 1994), 1297-1301.
17. L. M. Kirousis, E. Kranakis, and D. Krizanc, Approximating the unsatisfiability threshold of random formulae, Random Structure Algorithms, 12 (1998), 253-269.
18. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, Factor graphs and the sum-product algorithm, IEEE Trans Inform Theory 47(2) (2001), 498-519.
19. L. A. Levin, Average case complete problems, SIAM J Comput 14 (1986), 285-286.
20. M. Mézard and G. Parisi, The cavity method at zero temperature, J Statist Phys 111(1-2) (2003), 1-34.
21. M. Mézard, G. Parisi, and M. A. Virasoro, Spin glass theory and beyond, World Scientific, Singapore, 1987.
22. M. Mézard, F. Ricci-Tersenghi, and R. Zecchina, Two solutions to diluted p-spin models and XORSAT problems, J Statist Phys 111 (2003), 505-553.
23. M. Mézard, G. Parisi, and R. Zecchina, Analytic and algorithmic solution of random satisfiability problems. Science 297 (2002), 812-815.
24. M. Mézard and R. Zecchina, Random k-satisfiability: From an analytic solution to a new efficient algorithm, Phys Rev E 66 (2002), 056126.
25. R. Monasson and R. Zecchina, The entropy of the k-satisfiability problem, Phys Rev Lett 76 (1996), 3881.
26. R. Monasson and R. Zecchina, Statistical mechanics of the random k-satisfiability model, Phys Rev E 56(2) (1997), 1357-1370.
27. A. Montanari, M. Müller, and M. Mézard, The phase diagram of random heteropolymers, Phys Rev Lett 92 (2004), 185509.
28. A. Montanari and F. Ricci-Tersenghi, On the nature of the low-temperature phase in discontinuous mean-field spin glasses, Eur Phys J B 33 (2003), 339-346.
29. A. Montanari, G. Parisi, and F. Ricci-Tersenghi, Instability of one-step replica-symmetry-broken phase in satisfiability problems, J Phys A 37 (2004), 2073-2091.
30. F. Ricci-Tersenghi, M. Weigt, and R. Zecchina, Simplest random k-satisfiability problem, Phys Rev E 63 (2001), 026702.
31. O. Rivoire, G. Biroli, O. C. Martin, and M. Mézard, Glass models on bethe lattices, Eur Phys J B 37 (2004), 55-78.
32. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyanksy, Determining computational complexity from characteristic 'phase transitions,' Nature 400 (July 1999), 133-137.
33. S. Ben-David, B. Chor, O. Goldreich, and M. Luby, On the theory of average case complexity, Journal of Computer and System Sciences 44 (1992), 193-219.
34. TINA, 156-CPU selfmade Beowulf cluster at Otto von Guericke University, Magdeburg, http://tina.nat.uni-magdeburg.de.
35. Y. Gurevich, Average case completeness, Journal of Computer and System Sciences 42 (1991), 246-398.