The threshold for random k-SAT is 2k ln 2 -O(k)

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 223-231

  Achlioptas, Dimitris ^a   Peres, Yuval ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Phase transition; Satisfiability; Second moment method

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; PROBABILITY; PROBLEM SOLVING;

POLYNOMIAL TIME ALGORITHMS;

COMPUTATION THEORY;

EID: 0038107705     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780577     Document Type: Conference Paper

References (27)

1. D. Achlioptas and C. Moore. The asymptotic order of the random k-SAT threshold. In Proc. 43th Annual Symposium on Foundations of Computer Science, pages 126-127, 2002.
2. k ln 2 - O(k). Long version. Available at http://research.microsoft.com/̃optas/
3. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. 5th International Conference TACAS'99, pages 193-207, Berlin, Germany, 1999.
4. A. Braunstein, M. Mézard, and R. Zecchina. Survey propagation: an algorithm for satisfiability. Preprint, 2002.
5. M.-T. Chao and J. Franco. Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem. Inform. Sci., 51(3):289-314, 1990.
6. P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proc. 12th International Joint Conference on Artificial Intelligence (IJCAI-91) Vol. 1, pages 331-337. Morgan Kaufman, 1991.
7. V. Chvátal and B. Reed. Mick gets some (the odds are on his side). In Proc. 33th Annual Symposium on Foundations of Computer Science, pages 620-627, 1992.
8. N. G. de Bruijn. Asymptotic methods in analysis. Dover Publications Inc., New York, 3rd edition, 1981.
9. A. Dembo, Y. Peres, J. Rosen and O. Zeitouni. Thick points for planar Brownian motion and the Erdos-Taylor conjecture on random walk. Acta Math., 186:239-270, 2001.
10. P. Erdos and S. J. Taylor. Some problems concerning the structure of random walk paths. Acta Sci. Hung. 11:137-162, 1960.
11. O. Dubois, Y. Boufkhad, and J. Mandler. Typical random 3-SAT formulae and the satisfiability threshold. In Proc. 11th Annual Symposium on Discrete Algorithms, pages 126-127, 2000.
12. J. Franco and M. Paull. Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem. Discrete Appl. Math., 5(1):77-87, 1983.
13. E. Friedgut. Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem. J. Amer. Math. Soc., 12:1017-1054, 1999.
14. A. M. Frieze and S. Suen. Analysis of two simple heuristics on a random instance of k-SAT. J. Algorithms, 20(2):312-355, 1996.
15. A. Frieze and N. C. Wormald, Random k-SAT: a tight threshold for moderately growing k. In Proc. 5th International Symposium on Theory and Applications of Satisfiability Testing, pages 1-6, 2002.
16. C. P. Gomes, B. Selman, N. Crato, and H. Kautz. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Automat. Reason., 24(1-2):67-100, 2000.
17. A. Kaporis, L. M. Kirousis, and E. G. Lalas. The probabilistic analysis of a greedy satisfiability algorithm. In Proc. 10th Annual European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science, pages 574-585. Springer, 2002.
18. H. Kautz, D. McAllester, and B. Selman. Encoding plans in propositional logic. In Proc. 5th International Conference on Principles of Knowledge Representation and Reasoning, pages 374-384, 1996.
19. H. Kautz and B. Selman, Pushing the envelope: planning, prepositional logic, and stochastic search. In Proc. 13th National Conference on Artificial Intelligence, pages 1194-2001, 1996.
20. L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. Stamatiou. Approximating the unsatisfiability threshold of random formulas. Random Structures Algorithms, 12(3):253-269, 1998.
21. M. Mézard and R. Zecchina. Random K-satisfiability: from an analytic solution to a new efficient algorithm. Phys. Rev. E, 66, 056126, 2002.
22. M. Mézard, G. Parisi, and R. Zecchina. Analytic and Algorithmic Solution of Random Satisfiability Problems. Science, 297: 812-815, 2002.
23. D. G. Mitchell, B. Selman, and H. J. Levesque. Hard and easy distributions of SAT problems. In Proc. 10th National Conference on Artificial Intelligence, pages 459-462, 1992.
24. R. Monasson and R. Zecchina. Statistical mechanics of the random K-satisfiability model. Phys. Rev. E (3). 56(2): 1357-1370, 1997.
25. B. Selman and H. Kautz. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In Proc. 13th International Joint Conference on Artificial Intelligence, pages 290-295, 1993.
26. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proc. 10th National Conference on Artificial Intelligence, pages 440-446, 1992.
27. I. Stewart. Where drunkards hang out. Nature, News and Views, October 18, 2001.