Clustering of solutions in hard satisfiability problems

Journal of Statistical Mechanics: Theory and Experiment

Volumn , Issue 10, 2007, Pages

  Ardelius, John ^a   Aurell, Erik ^b   Krishnamurthy, Supriya ^c  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

^b ALBANOVA UNIVERSITY CENTER   (Sweden)

^c ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Energy landscapes (experiment); Finite size scaling; Network dynamics; Networks; Random graphs

Indexed keywords

EID: 35948985998     PISSN: 17425468     EISSN: 17425468     Source Type: Journal    
DOI: 10.1088/1742-5468/2007/10/P10012     Document Type: Article

References (28)

1. http://www.cs.washington.edu/homes/kautz/walksat/
2. 2001 NP-Hardness and Phase Transitions: Special Issue of Theoretical Computer Science vol 265 (Amsterdam: Elsevier)
3. Achlioptas D, Naor A and Peres Y 2005 Rigorous location of phase transitions in hard optimization problems Nature 435 759
4. Ardelius J and Aurell E 2006 Behavior of heuristics on large and hard satisfiability problems Phys. Rev. E 74 037702
5. Aurell E, Gordon U and Kirkpatrick S 2004 Comparing beliefs, surveys and random walks NIPS 2004: 18th Annual Conf. on Neural Information Processing Systems
6. Barthel W, Hartmann A K and Weigt M 2003 Solving satisfiability problems by fluctuations: the dynamics of stochastic local search algorithms Phys. Rev. E 67 066104
7. Biroli G, Monasson R and Weigt M 2000 A variational description of the ground state structure in random satisfiability problems Eur. Phys. J. B 14 551
8. Braunstein A and Zecchina R 2004 Survey propagation as local equilibrium equations J. Stat. Mech. P06007
9. 2005 The P Versus NP Problem Clay Mathematics Institute http://www.claymath.org/millennium/P_vs_NP
10. Davis M, Logemann G and Loveland D 1962 A machine program for theorem proving Commun. ACM 5 394
11. Gomes C P and Selman B 2005 Computational science: can get satisfaction Nature 435 751
12. Hartmann A K and Weigt M 2001 Phase Transitions in Combinatorial Optimization Problems (New York: Wiley-VCH)
13. Kirkpatrick S and Selman B 1994 Critical behavior in the satisfiability of random boolean expressions Science 264 1297
14. Krzakala F, Montanari A, Ricci-Tersenghi F, Semerjian G and Zdeborova L 2007 Gibbs states and the set of solutions of random constraint satisfaction problems Proc. Natl Acad. Sci. USA 104 10 318 [cond-mat/0612365]
15. Maneva E, Mossel E and Wainwright M J 2005 A new look at survey propagation and its generalizations SODA' 05: Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms (Philadelphia, PA: Society for Industrial and Applied Mathematics) p1089
16. Mertens S, Mézard M and Zecchina R 2006 Threshold values of random k-sat from the cavity method Random Struct. Algorithms 28 340
17. Mézard M, Mora T and Zecchina R 2005 Clustering of solutions in the random satisfiability problem Phys. Rev. Lett. 94 197205
18. Mézard M, Palassini M and Rivoire O 2005 Landscape of solutions in constraint satisfaction problems Phys. Rev. Lett. 95 200202
19. Mézard M, Parisi G and Zecchina R 2002 Analytic and algorithmic solutions of random satisfiability problems Science 297 812
20. Mézard M and Zecchina R 2002 The random k-satisfiability problem: from an analytic solution to an efficient algorithm Phys. Rev. E 66 056126
21. Mitchell D, Selman B and Levesque H 1992 Hard and easy distributions of sat problems AAAI-92: Proc. Am. Assoc. for Artif. Intell. p456
22. Monasson R, Zecchina R, Kirkpatrick S, Selman B and Troyansky L 1999 Computational complexity from 'characteristic' phase transitions Nature 400 133
23. Papadimitriou C H 1991 On selecting a satisfying truth assignment Proc. 32nd Annual Symp. on Foundations of Computer Science (Piscataway, NJ: IEEE Computer Society Press) p163
24. Papadimitriou C H and Steiglitz K 1999 Combinatorial Optimization: Algorithms and Complexity (New York: Dover)
25. Seitz S, Alva M and Orponen P 2005 Focused local search for random 3-satisfiability J. Stat. Mech. P06006
26. Selman B, Kautz H and Cohen B 1996 Local search strategies for satisfiability testing DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol 26 (AMS) p521
27. Semerjian G and Monasson R 2003 Relaxation and metastability in the randomwalksat search procedure Phys. Rev. E 67 066103
28. Wei W, Erenrich J and Selman B 2004 Towards efficient sampling: exploiting random walk strategies Proc. AAAI-04