A study of pure random walk on random satisfiability problems with "Physical" methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2919, Issue , 2004, Pages 120-134

  Semerjian, Guilhem ^a   Monasson, Rémi ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES;

DYNAMICAL TRANSITION; EXPONENTIAL PHASE; LINEAR PHASE; LOCAL SEARCH; RANDOM SATISFIABILITY PROBLEM; SAT INSTANCES; SATISFIABILITY PROBLEMS; STATISTICAL PHYSICS;

FORMAL LOGIC;

EID: 21144441770     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_10     Document Type: Article

References (21)

1. U. Schöning, A Probabilistic algorithm for k-SAT based on limited local search and restart, Algorithmica 32, 615-623 (2002).
2. M. Alekhnovich, E. Ben-Sasson, Analysis of the Random Walk Algorithm on Random 3-CNFs, preprint (2002).
3. S. Cocco, A. Montanari, R. Monasson, G. Semerjian, Approximate analysis of search algorithms with "physical" methods, cs.CC/0302003.
4. D. Mitchell, B. Selman, H. Levesque, Hard and Easy Distributions of SAT Problems, Proc. of the Tenth Natl. Conf. on Artificial Intelligence (AAAI-92), 440-446, The AAAI Press / MIT Press, Cambridge, MA (1992).
5. C.H. Papadimitriou, On Selecting a Satisfying Truth Assignment, Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, 163-169 (1991).
6. T. Hofmeister, U. Schöning, R. Schuler and O. Watanabe, A probabilistic 3-SAT algorithm further improved, Proceedings of 19th Symposium on Theoretical Aspects of Computer Science, LNCS 2285, 192-203 (2002).
7. S. Baumer and R. Schuler, Improving a probabilistic 3-SAT algorithm by dynamic search and independant clause pairs, in this volume.
8. A.J. Parkes, Scaling Properties of Pure Random Walk on Random 3-SAT, Lecture Notes in Computer Science 2470, 708 (2002).
9. G. Semerjian, R. Monasson, Relaxation and metastability in a local search procedure for the random satisfiability problem, Phys. Rev. E 67, 066103 (2003).
10. W. Barthel, A.K. Hartmann, M. Weigt, Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms, Phys. Rev. E 67, 066104 (2003).
11. H. H. Hoos, T. Stützle, Local Search Algorithms for SAT: An Empirical Evaluation, J. Automated reasoning 24, 421 (2000).
12. G. Semerjian, L.F. Cugliandolo, Cluster expansions in dilute systems: applications to satisfiability problems and spin glasses, Phys. Rev. E 64, 036115 (2001).
13. S. Cocco, R. Monasson, Restarts and exponential acceleration of random 3-SAT instances resolutions: a large deviation analysis of the Davis-Putnam-Loveland-Logemann algorithm, to appear in Annals of Mathematics and Artificial Intelligence (2003)
14. O. Dubois, J. Mandler, The 3-XORSAT threshold, Proc. of the 43rd annual IEEE symposium on Foundations of Computer Science, Vancouver, 769-778 (2002).
15. S. Cocco, O. Dubois, J. Mandler, R. Monasson, Rigorous decimation-based construction of ground pure states for spin glass models on random lattices, Phys. Rev. Lett. 90, 047205 (2003).
16. M. Mézard, F. Ricci-Tersenghi, R. Zecchina, Alternative solutions to diluted p-spin models and XORSAT problems, J. Stat. Phys. 111, 505 (2003).
17. k(ln 2 + o(1)), preprint (2002).
18. R. Monasson, R. Zecchina, Statistical mechanics of the random K-satisfiability model, Phys. Rev. E 56, 1357 (1997).
19. B. Selman, H. Kautz and B. Cohen, Noise Strategies for Improving Local Search, Proc. AAAI-94, Seattle, WA, 337-343 (1994).
20. D. McAllester, B. Selman, H. Kautz, Evidence for Invariants in Local Search, Proc. AAAI-97, Providence, RI (1997).
21. S. Seitz, P. Orponen, An efficient local search method for random 3-Satisfiability, preprint (2003).