Determining computational complexity from characteristic 'phase transitions'

Nature

Volumn 400, Issue 6740, 1999, Pages 133-137

  Monasson, Rémi ^a   Zecchina, Riccardo ^b   Kirkpatrick, Scott ^c   Selman, Bart ^d   Troyansky, Lidror ^e  

^a CNRS   (France)

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

^c IBM T J WATSON RESEARCH CENTER   (United States)

^d Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^e HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ANALYTIC METHOD; ARTICLE; COST; PHASE TRANSITION; PRIORITY JOURNAL; PROBLEM SOLVING;

EID: 0033536221     PISSN: 00280836     EISSN: None     Source Type: Journal    
DOI: 10.1038/22055     Document Type: Article

References (36)

1. Cook, S. A. in Proc. 3rd Annu. ACM Symp. on Theory of Computing 151-158 (Assoc. Comput. Machinery, New York, 1971).
2. Garey, M. & Johnson, D. S. Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, San Francisco, 1979).
3. Papadimitriou, C. Computational Complexity (Addison-Wesley, Readings, 1994).
4. Fu, Y. T. & Anderson, P. W. Application of statistical mechanics to NP-complete problems in combinatorial optimization. J. Phys. A 19, 1605-1620 (1985).
5. Mézaid, M., Parisi, G. & Virasoro, M. A. Spin Glass Theory and Beyond (World Scientific, Singapore, 1987).
6. Cheeseman, P., Kanefsky, B. & Taylor, W. M. in Proc. 13th Int. Joint Conf. on Artificial Intelligence (IJCAI-91) (eds Mylopoulos, J. & Reiter, R.) 331-337 (Morgan Kaufmann, San Mateo, California, 1991).
7. Mitchell, D., Selman, B. & Levesque, H. in Proc. 10th Natl. Conf. on Artificial Intelligence (AAAI-92) 440-446 (AAAI Press/MIT Press, Cambridge, Massachusetts, 1992).
8. Kirkpatrick, S. & Selman, B. Critical behavior in the satisfiability of random Boolean expressions. Science 264, 1297-1301 (1994).
9. Selman, B., Mitchell, D. & Levesque, H. Generating hard satisfiability problems. Artif. Intell. 81, 17-29 (1996).
10. Hogg, T., Huberman, B. A. & Williams, C. (eds) Frontiers in problem solving: phase transitions and complexity. Artif. Inell. 81(I & II) (1996).
11. Hayes, B. Can't get no satisfaction. Am. Sci. 85, 108-112 (1996).
12. Gross, D. & Mezard, M. The simplest spin glass. Nucl. Phys. B 240, 431-452 (1984).
13. Aspvall, B., Plass, M. F. & Tarjan, R. E. A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8, 121-123 (1979).
14. Goerdt, A. A threshold for unsatisfiability. J. Comput. System Sci. 53, 469-486 (1996).
15. Chvàtal, V. & Reed, B. Mick gets some (the odds are on his side). Proc. 33rd IEEESymp. on Foundations of Computer Science 620-627 (IEEE Computer Soc. Press, New York, 1992).
16. Friedgut, E. Sharp thresholds of graph properties and the K-SAT problem. J. Am. Math. Soc (in the press).
17. Beams, P., Karp, R., Pitassi, T. & Saks, M. in Proc. ACM Symp. on Theory of Computing (STOC98) 561-571 (Assoc. Comput. Machinery, New York, 1998).
18. Monasson, R. & Zecchina, R. Entropy of the K-satisfiability problem. Phys. Rev. Lett. 76, 3881-3885 (1996).
19. Monasson, R. & Zecchina, R. The statistical mechanics of the random K-satisfiability model. Phys. Rev. E 56, 1357-1370 (1997).
20. Monasson, R. & Zecchina, R. Tricritical points in random combinatorics: the 2+p SAT case. J. Phys. A 31, 9209-9217 (1998).
21. Achlioptas, D., Kirousis, L., Kranakis, E. & Krizanc, D. in Proc. Workshop on Randomized Algorithms in Sequential, Parallel and Distributed Computing (RALCOM 97), 1-10 (1998).
22. Davis, M. & Putnam, H. A computing procedure for quantification theory. J. Assoc. Comput. Machinery 7, 201-215 (1960).
23. Selman, B. & Kirkpatrick, S. Critical behavior in the cost of K-satisfiability. Artif. Intell. 81, 273-295 (1996).
24. Gomes, C. P., Selman, B. & Crato, N. in Principles and Practice of Constraint Programming (CP97) (ed. Smolka, G.) 121-135 (Lect. Notes in Comput. Sci., Vol. 1330, Spring, Heidelberg, 1997).
25. Kirkpatrick, T. R., Thirumalai, D. & Wolynes, P. G. Scaling concepts for the dynamics of viscous liquids near an ideal glassy state. Phys. Rev. A 40, 1045-1054 (1989).
26. Angell, A. C. Formation of glasses from liquids and biopolymers Science 267, 1924-1935 (1995).
27. Bouchaud, J.-P., Cates, M. E., Ravi Prakash, J. & Edwards, S. F. Hysteresis and metastability in a continuum sandpile model. Phys. Rev. Lett. 74, 1982-1985 (1995).
28. Jacobs, D. J. & Thorpe, M. F. Generic rigidity percolation: the pebble game. Phys. Rev. Lett. 75, 4051-4054 (1995).
29. Moukarzel, C. & Duxbury, P. M. Stressed backbone and elasticity of random central-force systems. Phys. Rev. Lett. 75, 4055-4058 (1995).
30. Kirkpatrick, S. & Toulouse, G. Configuration space analysis of traveling salesman problems. J. Phys. (France) 46, 1277-1292 (1985).
31. Schneider, J., Froschhammer, C., Morgenstern, I., Husslein, T. & Singer, J. M. Searching for backbones - an efficient parallel algorithm for the traveling salesman problem. Comput. Phys. Commun. 96, 173-188 (1996).
32. Kirousis, L., Kranakis, E. & Krizanc, D. in Proc. 4th European Symp. on Algorithms 27-38 (Springer, Berlin, 1996).
33. Dubois, O. & Boufkhad, Y. A general upper bound for the satisfiability threshold of random K-SAT formulas. J. Algorithms 24, 395-420 (1997).
34. Kamath, A., Motwani, R., Palem, K. & Spirakis, P. Tail bounds for occupancy and the satisfiability threshold conjecture. Random Struct. Algorithms 7, 59-89 (1995).
35. Frieze, A. & Suen, S. Analysis of two simple heuristics on a random instance of K-SAT. J. Algorithms 20, 312-335 (1996).
36. Crawford, J. & Auton, L. in Proc. 11th Natl. Conference on Artificial Intelligence (AAAI-93) 21-27 (AAAI Press/MIT Press, Cambridge, Massachusetts, 1993).