Rigorous location of phase transitions in hard optimization problems

Nature

Volumn 435, Issue 7043, 2005, Pages 759-764

  Achlioptas, Dimitris ^a   Naor, Assaf ^a   Peres, Yuval ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

CRITICAL BEHAVIOR; RANDOM INSTANCES;

PHASE TRANSITIONS;

OPTIMIZATION;

ALGORITHM; ARTICLE; ENTROPY; PHASE TRANSITION; PHYSICS; PREDICTION; PRIORITY JOURNAL; PROBABILITY; SOLUTION AND SOLUBILITY; STATISTICAL ANALYSIS;

EID: 20544464593     PISSN: 00280836     EISSN: None     Source Type: Journal    
DOI: 10.1038/nature03602     Document Type: Article

References (25)

1. Cook, S. A. The complexity of theorem-proving procedures. Proc. 3rd Ann. ACM Symp. on Theory of Computing 151-158 (1971).
2. Cheeseman, P., Kanefsky, B. & Taylor, W. Where the really hard problems are. Proc. 12th Int. Joint Conf. on Artificial Intelligence 331-337 (1991).
3. Selman, B., Levesque, H. & Mitchell, D. Hard and easy distributions of SAT problems. Proc. 10th Nat. Conf. on Artificial Intelligence 459-465 (1992).
4. Kirkpatrick, S. & Selman, B. Critical behavior in the satisfiability of random boolean expressions. Science 264, 1297-1301 (1994).
5. Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B. & Troyansky, L. Determining computational complexity from characteristic 'phase transitions'. Nature 400, 133-137 (1999).
6. Fu, Y. & Anderson, P. W. Application of statistical mechanics to NP-complete problems in combinatorial optimisation. J. Phys. A 19, 1605-1620 (1986).
7. Anderson, P. W. Solving problems in finite time. Nature 400, 115-116 (1999).
8. Gomes, C. P. & Selman, B. Satisfied with physics. Science 297, 784-785 (2002).
9. Monasson, R. & Zecchina, R. Statistical mechanics of the random K-satisfiability model. Phys. Rev. E 56, 1357-1370 (1997).
10. Mézard, M. & Zecchina, R. Random K-satisfiability: from an analytic solution to a new efficient algorithm. Phys. Rev. E 66, 056126 (2002).
11. Mézard, M., Parisi, G. & Zecchina, R. Analytic and algorithmic solution of random satisfiability problems. Science 297, 812-815 (2002).
12. Mertens, S., Mézard, M. & Zecchina, R. Threshold values of random k-SAT from the cavity method. To appear in Random Struct. Algorithms (in the press); preprint at http://arxiv.org/abs/cs.CC/0309020 (2003).
13. Appel, K. & Haken, W. Every planar map is four colorable. Contemp. Math. 98, (1989).
14. Achlioptas, D. & Moore, C. The asymptotic order of the random k-SAT threshold. Proc. 43rd Ann. IEEE Symp. on Foundations of Computer Science 779-788 (2002).
15. k log 2 - O(k). J. Am. Math. Soc. 17, 947-973 (2004).
16. Friedgut, E. Sharp thresholds of graph properties, and the k-SAT problem. J. Am. Math. Soc. 12, 1017-1054 (1999).
17. Achlioptas, D., Naor, A. & Peres, Y. On the maximum satisfiability of random formulas. Proc. 44th Ann. IEEE Symp. on Foundations of Computer Science 362-370 (2003).
18. Bollobás, B. Random Graphs Vol. 73, 2nd edn Cambridge Studies in Advanced Mathematics (Cambridge Univ. Press, Cambridge, 2001).
19. Achlioptas, D. & Naor, A. The two possible values of the chromatic number of a random graph. Proc. 36th Ann. ACM Symp. on Theory of Computing 587-593 (2004).
20. Krzakala, F., Pagnani, A. & Weigt, M. Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs. Phys. Rev. E 70, 046705 (2004).
21. Kirousis, L. M., Kranakis, E., Krizanc, D. & Stamatiou, Y. Approximating the unsatisfiability threshold of random formulas. Random Struct. Algorithms 12, 253-269 (1998).
22. Dubois, O., Boufkhad, Y. & Mandler, J. Typical random 3-SAT formulae and the satisfiability threshold. Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms 126-127 (2000).
23. Kaporis, A. C., Kirousis, L. M. & Lalas, E. G. The probabilistic analysis of a greedy satisfiability algorithm. Proc. 10th Ann. European Symp. on Algorithms 574-585 (2002).
24. Frieze, A. M. & Suen, S. Analysis of two simple heuristics on a random instance of k-SAT. J. Algorithms 20, 312-355 (1996).
25. Coppersmith, D., Gamarnik, D., Hajiaghayi, M. T. & Sorkin, G. B. Random MAX SAT random MAX CUT, and their phase transitions. Random Struct. Algorithms 24, 502-545 (2004).