Random [formula presented]-satisfiability problem: From an analytic solution to an efficient algorithm

Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

Volumn 66, Issue 5, 2002, Pages 27-

  Mézard, Marc ^a   Zecchina, Riccardo ^b  

^a UNIVERSITÉ PARIS SUD   (France)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; MAGNETIC FIELDS; OPTIMIZATION; PHASE DIAGRAMS; PROBLEM SOLVING; RANDOM PROCESSES;

BOOLEAN VARIABLES; GRAPH PARTITIONING; K-SATISFIABILITY (K-SAT) PROBLEM; RANDOM EXCHANGE COUPLING;

BOOLEAN ALGEBRA;

ARTICLE;

EID: 37649031218     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.66.056126     Document Type: Article

References (54)

1. S. Cook, in Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (ACM, New York, 1971), p. 151.
2. M. Garey and D. S. Johnson, Computers and Intractability; A guide to the Theory of NP-completeness (Freeman, San Francisco, 1979);C. H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).
3. M. Mézard, G. Parisi, and M. A. Virasoro, Spin Glass Theory and Beyond (World Scientific, Singapore, 1987).
4. R. Monasson and R. Zecchina, Phys. Rev. Lett. 76, 3881 (1996).
5. R. Monasson and R. Zecchina, Phys. Rev. E 56, 1357 (1997).
6. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, Science 220, 671 (1983);
7. V. Černy, J. Optim. Theory Appl. 45, 41 (1985).
8. M. Mézard and G. Parisi, J. Phys. (France) Lett. 46, L771 (1985).
9. D. Aldous, Random Struct. Algorithms 18, 381 (2001).
10. Y. Fu and P. W. Anderson, J. Phys. A 19, 1605 (1986).
11. L. A. Levin, SIAM J. Comput. 14, 285 (1986).
12. S. Ben-David, B. Chor, O. Goldreich, and M. Luby, J. Cell Sci. Suppl. 44, 193 (1992).
13. Y. Gurevich, J. Cell Sci. Suppl. 42, 246 (1991).
14. Artif. Intel. 81(1996).
15. S. A. Cook and D. G. Mitchell, Satisfiability Problem: Theory and Applications, edited by Du, Gu, and Pardalos, DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 35 (American Mathematical Society, 1997).
16. Theor. Comput. Sci. 265(2001), special issue on phase transitions in combinational problems, edited by O. Dubois, R. Monasson, B. Selman, and R. Zecchina.
17. S. Kirkpatrick and B. Selman, Science 264, 1297 (1994).
18. For a review, see J.-P. Bouchaud, L. Cugliandolo, J. Kurchan, and M. Mézard, in Spin Glasses and Random Fields, edited by A. P. Young (World Scientific, Singapore, 1998).
19. J. S. Yedidia, W. T. Freeman, and Y. Weiss, Understanding Belief Propagation and its Generalizations (IJCAI, 2001).
20. M. Mézard, G. Parisi, and R. Zecchina, Science 297, 812 (2002).
21. M. Mézard and G. Parisi, Eur. Phys. J. B 20, 217 (2001).
22. M. Mézard and G. Parisi, The Cavity Method at Zero Temperature (to be published).
23. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, IEEE Trans. Inf. Theory 47, 498 (2002).
24. F. Ricci-Tersenghi, M. Weigt, and R. Zecchina, Phys. Rev. E 63, 026702 (2001).
25. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, Nature (London) 400, 133 (1999).
26. B. Bollobàs, Random Graphs (Academic Press, New York, 1985).
27. M. Mézard and G. Parisi, Europhys. Lett. 3, 1067 (1987).
28. A. Z. Broder, A. M. Frieze, and E. Upfal, in Proceedings of theFourth Annual ACM-SIAM Symposium on Discrete Algorithms (ACM-SIAM, New York, 1993), pp. 322–330.
29. M. Mézard, G. Parisi, and M. A. Virasoro, Europhys. Lett. 1, 77 (1986).
30. M. Talagrand, Probability Theory and Related Fields, 117, 303 (2002).
31. R. Monasson, J. Phys. A 31, 513 (1998).
32. R. Monasson, Phys. Rev. Lett. 75, 2847 (1995).
33. S. Franz and G. Parisi, J. Phys. I 5, 1401 (1995).
34. A. Goerdt, in Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science, Prague, 1992 (unpublished).
35. V. Chvàtal and B. Reed, in Proceedings of the 33rd IEEE Symp. on Foundations of Computer, 1992 (unpublished), p. 620.
36. B. Bollobàs, C. Borgs, J. T. Chayes, J. Han Kim, and D. B. Wilson, Rand Struct. Algorithms 18, 301 (2001).
37. J. A. Crawford and L. D. Auton, Artif. Intel. 81, 31 (1996).
38. A. Kaporis, L. Kirousis, and E. Lalas, in Proceedings of the 4th European Symposium on Algorithms, ESA, 2002, Lecture Notes in Computer Science (Springer-Verlag, Berlin, 2002).
39. D. Achlioptas and G. Sorkin, Proceedings of the 41st Annual Symposium of Foundations of Computer Science (IEEE Computer Society Press, Los Alamitos, CA, 2000), p. 590.
40. J. Franco, Theor. Comput. Sci. 265, 147 (2001).
41. O. Dubois, Y. Boufkhad, and J. Mandler, in Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, Vol. 124 (ACM-SIAM, San Francisco, CA, 2000).
42. G. Biroli, R. Monasson, and M. A. Weigt, Eur. Phys. J. B 14, 551 (2000).
43. S. Franz, M. Leone, F. Ricci-Tersenghi, and R. Zecchina, Phys. Rev. Lett. 87, 127209 (2001).
44. P. Svenson and M. G. Nordahl, Phys. Rev. E 59, 3983 (1999).
45. Note that the existence of finite local fields is true for states of arbitrary energy. In particular, considering the zero energy states, selected by a reweighting (Formula presented) one sees from Eq. (57) that their nontrivial cavity fields scale as (Formula presented) however when computing the local fields as in Eq. (70), the extra reweighting exactly compensates this scaling, giving finite local fields also when (Formula presented)
46. G. Parisi (unpublished).
47. R. Kikuchi, Phys. Rev. 81, 988 (1951).
48. J. S. Yedidia, W. T. Freeman, and Y. Weiss, in Advances in Neural Information Processing Systems 13, edited by T. K. Leen, T. G. Dietterich, and V. Tresp (MIT Press, Cambridge, MA, 2001), pp. 689–695.
49. B. Selman, H. Kautz, and B. Cohen, Local Search Strategies for Satisfiability Testing, Proceedings of DIMACS (American Mathematical Society, New York, 1993), p. 661.
50. L. Leuzzi and G. Parisi, J. Stat. Phys. 103, 679 (2001);
51. A. Crisanti, L. Leuzzi, and G. Parisi, J. Phys. A 35, 481 (2002).
52. A. Braunstein, M. Mézard, and R. Zecchina (unpublished).
53. M. Mézard, F. Ricci-Tersenghi, and R. Zecchina, e-print cond-mat/0207140.
54. S. Cocco, O. Dubois, J. Mandler, and R. Monasson, e-print cond-mat/0206239.