Threshold behaviour of WalkSAT and Focused Metropolis search on random 3-satisfiability

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 475-481

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

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; PROBLEM SOLVING;

LOCAL SEARCH ALGORITHM; SATISFIABILITY;

ALGORITHMS;

EID: 26444436863     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499107_41     Document Type: Conference Paper

References (20)

1. E. Aurell, U. Gordon, S. Kirkpatrick, Comparing beliefs, surveys and random walks. NIPS 2004. arXiv.org: cond-mat/0406217.
2. W. Barthel, A. K. Hartmann, M. Weigt, Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms. Phys. Rev. E 67 (2003), 066104.
3. A. Braunstein, M. Mézard, R. Zecchina, Survey propagation: an algorithm for satisfiability. arXiv.org:cs.CC/0212002.
4. G. Dueck, New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104 (1993), 86-92.
5. H. H. Hoos, An adaptive noise mechanism for WalkSAT. AAAI 2002, 655-660.
6. H. H. Hoos, T. Stützle, Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artif. Intell. 112 (1999), 213-232.
7. H. Jia, C. Moore, B. Selman, From spin glasses to hard satisfiable formulas. SAT'04.
8. D. McAllester, B. Selman, H. Kautz, Evidence for invariants in local search. AAAI 1997, 321-326.
9. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, E. Teller, Equations of state calculations by fast computing machines, J. Chem. Phys. 21 (1953), 1087-1092.
10. D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems. AAAI 1992, 459-465.
11. C. Papadimitriou, On selecting a satisfying truth assignment. FOCS 1991, 163-169.
12. G. Parisi, On local equilibrium equations for clustering states. arXiv.org:cs.CC/0212047.
13. A. J. Parkes, Distributed local search, phase transitions, and polylog time. Proc. Workshop on Stochastic Search Algorithms, IJCAI 2001.
14. A. J. Parkes, Scaling properties of pure random walk on random 3-SAT. CP 2002, 708-713. Springer LNCS 2470.
15. S. Seitz, P. Orponen, An efficient local search method for random 3-satisfiability. Workshop on Typical Case Complexity and Phase Transitions, LICS 2003. Electronic Notes in Discrete Mathematics 16, Elsevier 2003.
16. S. Seitz, M. Alava, P. Orponen, Focused local search for random 3-satisfiability. arXiv.org:cond-mat/0501707.
17. B. Selman, H. Kautz, B. Cohen, Local search strategies for satisfiability testing. Cliques, Coloring, and Satisfiability, 521-532. AMS DIMACS Series 26, 1996.
18. G. Semerjian, R. Monasson, Relaxation and metastability in a local search procedure for the random satisfiability problem. Phys. Rev. E 67 (2003), 066103.
19. G. Semerjian, R. Monasson, A study of Pure Random Walk on random satisfiability problems with "physical" methods. SAT 2003, 120-134. Springer LNCS 2919.
20. W. Wei, B. Selman, Accelerating random walks. CP 2002, 216-232. Springer LNCS 2470.