Circumspect descent prevails in solving random constraint satisfaction problems

Proceedings of the National Academy of Sciences of the United States of America

Volumn 105, Issue 40, 2008, Pages 15253-15257

  Alava, Mikko ^a   Ardelius, John ^b,c   Aurell, Erik ^c,d   Kaski, Petteri ^e   Krishnamurthy, Supriya ^b,d   Orponen, Pekka ^a   Seitz, Sakari ^a  

^a AALTO UNIVERSITY   (Finland)

^b SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

^c ALBANOVA UNIVERSITY CENTER   (Sweden)

^d ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^e UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Geometry of solutions; Local search; Performance; Random K SAT

Indexed keywords

ALGORITHM; ARTICLE; GEOMETRY; POLYMERIZATION; PRIORITY JOURNAL; RANDOM K SATISFIABILITY; RANDOMIZATION; SOLUTION AND SOLUBILITY; STOCHASTIC LOCAL SEARCH;

EID: 55749098814     PISSN: 00278424     EISSN: 10916490     Source Type: Journal    
DOI: 10.1073/pnas.0712263105     Document Type: Article

References (26)

1. Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco).
2. Du D, Gu J, Pardalos P, eds (1997) Satisfiability Problem: Theory and Applicationsm, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (Am Math Soc, Providence RI), Vol 35.
3. Martin OC, Monasson R, Zecchina R (2001) Statistical mechanics methods and phase transitions in optimization problems. Theor Comput Sci 265:3-67.
4. Dubois O, Monasson R, Selman B, Zecchina R, eds (2001) Special Issue on NP-Hardness and Phase Transitions. Theor Comput Sci 265.
5. Mitchell D, Selman B, Levesque H (1992) Hard and Easy Distributions of SAT Problems, Proceedings of the 10th National Conference on Artificial Intelligence (AAAI Press, San Jose, CA), AAAI-92, pp 459-465.
6. Davis M, Logemann G, Loveland DW (1962) A machine program for theorem proving. Commun ACM 5:394-397.
7. Mézard M, Parisi G, Zecchina R (2002) Analytic and algorithmic solutions of random satisfiability problems. Science 297:812-815.
8. Aarts E, Lenstra JK, eds (1997) Local Search for Combinatorial Optimization (Wiley, New York).
9. Hoos HH, Stützle T (2005) Stochastic Local Search: Foundations and Applications (Elsevier, Amsterdam).
10. Selman B, Kautz H, McAllester D (1997) Ten Challenges in Propositional Reasoning and Search, Proceedings of the 15th International Joint Conference on Artificial Intelligence (Elsevier, Amsterdam), IJCAI-97, pp 50-54.
11. Kautz H, Selman B (2007) The state of SAT. Discrete Appl Math 155:1514-1524.
12. Kirkpatrick S, Gelatt SD, Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671-680.
13. Papadimitriou CH (1991) On Selecting a Satisfying Truth Assignment, Proceedings of the 32nd IEEE Symposium on the Foundations of Computer Science (IEEE Computer Society, New York), FOCS-91, pp 163-169.
14. Barthel W, Hartmann AK, Weigt M (2003) Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms. Phys Rev E 67:066104.
15. Semerjian G, Monasson R (2003) Relaxation and metastability in a local search procedure for the random satisfiability problem. Phys Rev E 67:066103.
16. Selman B, Kautz H, Cohen B (1996) in Cliques, Coloring, and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, eds Johnson DS, Trick MA (Am Math Soc, Providence RI), Vol 26, pp 521-532
17. Ardelius J, Aurell E (2006) Behavior of heuristics on large and hard satisfiability problems. Phys Rev E 74:037702.
18. Aurell E, Gordon U, Kirkpatrick S (2005) Comparing Beliefs, Surveys and Random Walks. Advances in Neural Information Processing Systems (NIPS-04) (MIT Press, Boston), Vol 17, pp 49-56 .
19. Seitz S, Alava M, Orponen P (2005) Focused local search for random 3-satisfiability. J Stat Mech Theor Exp 06006.
20. Mertens S, Mézard M, Zecchina R (2006) Threshold values for random K-SAT from the cavity method. Rand Struct Algorithms 28:340-373.
21. Mézard M, Mora T, Zecchina R (2005) Clustering of solutions in the random satisfiability problem. Phys Rev Lett 94:197205.
22. Krzakala F, Montanari A, Ricci-Tersenghi F, Semerjian G, Zdeborova L (2007) Gibbs states and the set of solutions of random constraint satisfaction problems. Proc Natl Acad Sci USA 104:10318-10323.
23. Battaglia D, Braunstein A, Chavas J, Zecchina R (2005) Source coding by efficient selection of ground-state clusters. Phys Rev E 72:015103.
24. Parisi G (2002) On local equilibrium equations for clustering states. Technical Report cs.CC/0212047. Available at http://arxiv.org/abs/cs/ 0212047.
25. Semerjian G (2008) On the freezing of variables in random constraint satisfaction problems. J Stat Phys 130:251-293.
26. Kroc L, Sabharwal A, Selman B (2007) Survey Propagation Revisited, Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence (UAI-07) (AUAI Press, Arlington, VA), pp 217-226.