Focused local search for random 3-satisfiability

Journal of Statistical Mechanics: Theory and Experiment

Volumn , Issue 6, 2005, Pages 89-115

  Seitz, Sakari ^a,b   Alava, Mikko ^b   Orponen, Pekka ^a  

^a AALTO UNIVERSITY   (Finland)

^b Laboratory of Physics   (Finland)

Author keywords

Analysis of algorithms; Energy landscapes (experiment); Stochastic search; Typical case computational complexity

Indexed keywords

EID: 22144445688     PISSN: 17425468     EISSN: None     Source Type: Journal    
DOI: 10.1088/1742-5468/2005/06/P06006     Document Type: Article

References (32)

1. Aarts E and Lenstra J K (ed) 1997 Local Search for Combinatorial Optimization (New York: Wiley)
2. Aurell E, Gordon U and Kirkpatrick S 2005 Comparing beliefs, surveys and random walks Technical Report Adv. Neural Inform. Process. Syst. 17 at press [cond-mat/0406217]
3. 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
4. Braunstein A, Mézard M and Zecchina R 2002 Survey propagation: an algorithm for satisfiability Technical Report [cs.CC/0212002]
5. Braunstein A and Zecchina R 2004 Survey propagation as local equilibrium equations J. Stat. Mech. P06007
6. Cocco S, Monasson R, Montanari A and Semerjian G 2003 Approximate analysis of search algorithms with 'physical' methods Technical Report [cs.CC/0302003]
7. Du D, Gu J and Pardalos P (ed) 1997 Satisfiability Problem: Theory and Applications (DIMACS Series in Discr. Math. and Theoret. Comput. Sci. vol 35) (Providence, RI: American Mathematical Society)
8. Dueck G 1993 New optimization heuristics: the great deluge algorithm and the record-to-record travel J. Comput. Phys. 104 86-92
9. Garey M R and Johnson D S 1979 Computers and Intractability: A Guide to the Theory of NP-Completeness (San Francisco, CA: Freeman)
10. Gu J 1992 Efficient local search for very large-scale satisfiability problems ACM SIGART Bull. 3 8-12
11. Hoos H H 2002 An adaptive noise mechanism for WalkSAT AAAI-02: Proc. 18th Natl Conf. on Artificial Intelligence (San Jose, CA: AAAI Press) pp 655-60
12. Hoos H H and Stützle T 1999 Towards a characterisation of the behaviour of stochastic local search algorithms for SAT Artif. Intell. 112 213-32
13. Hoos H H and Stützle T 2005 Stochastic Local Search: Foundations and Applications (San Francisco, CA: Morgan Kaufmann)
14. Jia H, Moore C and Selman B 2004 From spin glasses to hard satisfiable formulas SAT 2004: Proc. 7th Int. Conf. on Theory and Applications of Satisfiability Testing (Berlin: Springer) at press
15. Maneva E, Mossel E and Wainwright M J 2004 A new look at survey propagation and its generalizations Technical Report [cs.CC/0409012]
16. Mertens S, Mézard M and Zecchina R 2003 Threshold values of random K-SAT from the cavity method Technical Report Algorithmica at press [cs.CC/0309020]
17. Metropolis N, Rosenbluth A, Rosenbluth M, Teller A and Teller E 1953 Equations of state calculations by fast computing machines J. Chem. Phys. 21 1087-92
18. Mézard M, Ricci-Tersenghi F and Zecchina R 2003 Alternative solutions to diluted p-spin models and XORSAT problems J. Stat. Phys. 111 505-33
19. Mézard M and Zecchina R 2002 Random K-satisfiability problem: From an analytic solution to an efficient algorithm Phys. Rev. E 66 056126
20. Mitchell D, Selman B and Levesque H 1992 Hard and easy distributions of SAT problems AAAI-92: Proc. 10th Natl Conf. on Artificial Intelligence (San Jose, CA: AAAI Press) pp 459-65
21. Montanari A, Parisi G and Ricci-Tersenghi F 2004 Instability of one-step replica-symmetry-broken phase in satisfiability problems J. Phys. A: Math. Gen. 37 2073
22. Papadimitriou C H 1991 On selecting a satisfying truth assignment FOCS-91: Proc. 32nd IEEE Symp. on the Foundations of Computer Science (New York: IEEE Computer Society) pp 163-9
23. Parisi G 2002 On local equilibrium equations for clustering states Technical Report [cs.CC/0212047]
24. Parkes A J 2001 Distributed local search, phase transitions, and polylog time IJCAI-01: Proc. Workshop on Stochastic Search Algorithms, 17th Int. Joint Conf. on Artificial Intelligence
25. Parkes A J 2002 Scaling properties of pure random walk on random 3-SAT CP 2002: Proc. 8th Int. Conf. on Principles and Practice of Constraint Programming (Springer Lecture Notes in Computer Science vol 2470) (Berlin: Springer) pp 708-13
26. Seitz S and Orponen P 2003 An efficient local search method for random 3-satisfiability Proc. IEEE LICS'03 Workshop on Typical Case Complexity and Phase Transitions (Electronic Notes in Discrete Mathematics vol 16) (Amsterdam: Elsevier)
27. Selman B, Kautz H and Cohen B 1996 Local search strategies for satisfiability testing Cliques, Coloring, and Satisfiability (DIMACS Series in Discr. Math. and Theoret. Comput. Sci. vol 26) ed D S Johnson and M A Trick (Providence, RI: American Mathematical Society) pp521-32
28. Selman B, Levesque H J and Mitchell D G 1992 A new method for solving hard satisfiability problems AAAI-92: Proc. 10th Natl Conf. on Artificial Intelligence (San Jose, CA: AAAI Press) pp 440-6
29. Schöning U 2002 A probabilistic algorithm for k-SAT based on limited local search and restart Algorithmica 32 615
30. Semerjian G and Monasson R 2003 Relaxation and metastability in a local search procedure for the random satisfiability problem Phys. Rev. E 67 066103
31. Semerjian G and Monasson R 2004 A study of pure random walk on random satisfiability problems with 'physical' methods SAT 2003: Proc. 6th Int. Conf. on Theory and Applications of Satisfiability Testing (Springer Lecture Notes in Computer Science vol 2919) (Berlin: Springer) pp 120-34
32. Wei W and Selman B 2002 Accelerating random walks CP 2002: Proc. 8th Int. Conf. on Principles and Practice of Constraint Programming (Springer Lecture Notes in Computer Science vol 2470) (Berlin: Springer) pp 216-32