The asymptotic order of the random k-SAT threshold

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 779-788

  Achlioptas, Dimitris ^a   Moore, Cristopher ^b,c  

^a MICROSOFT RESEARCH   (United States)

^b University of New Mexico   (United States)

^c SANTA FE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

ASYMPTOTIC ORDER; RANDOM THRESHOLD; SATISFIABILITY THRESHOLD CONJECTURE;

COMPUTER SCIENCE;

EID: 0036957620     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. D. Achlioptas. Setting two variables at a time yields a new lower bound for random 3-SAT. In Proc. 32nd Annual ACM Symposium on Theory of Computing, pages 28-37, 2000.
2. D. Achlioptas, A. Chtcherba, B. Istrate, and C. Moore. The phase transition in 1-in-k SAT and NAE 3-SAT. In Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 721-722, 2001.
3. D. Achlioptas and G. B. Sorkin. Optimal myopic algorithms for random 3-SAT. In Proc. 41st Annual Symposium on Foundations of Computer Science, pages 590-600, 2000.
4. A. Z. Broder, A. M. Frieze, and E. Upfal. On the satisfiability and maximum satisfiability of random 3-CNF formulas. In Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 322-330, 1993.
5. M.-T. Chao and J. Franco. Probabilistic analysis of two heuristics for the 3-satisfiability problem. SIAM J. Comput., 15(4):1106-1118, 1986.
6. 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.
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. V. Chvátal and E. Szemerédi. Many hard examples for resolution. J. Assoc. Comput. Mach., 35(4):759-768, 1988.
9. N. G. de Bruijn. Asymptotic methods in analysis. Dover Publications Inc., New York, third edition, 1981.
10. O. Dubois, Y. Boufkhad, and J. Mandler. Typical random 3-SAT formulae and the satisfiability threshold. In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 126-127, 2000.
11. A. El Maftouhi and W. Fernandez de la Vega On random 3-sat. Combin. Probab. Comput., 4(3): 189-195, 1995.
12. W. Fernandez de la Vega. On random 2-SAT. Manuscript, 1992.
13. 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.
14. 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.
15. A. Frieze and N. C. Wormald. Random k-SAT: a tight threshold for moderately growing k. In Proceedings of the 5th International Symposium on Theory and Applications of Satisfiability Testing, pages 1-6, 2002.
16. 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.
17. A. Goerdt. A threshold for unsatisfiability. J. Comput. System Sci., 53(3):469-486, 1996.
18. A. Haken. The intractability of resolution. Theoret. Comput. Sci., 39(2-3):297-308, 1985.
19. S. Janson, Y. C. Stamatiou, and M. Vamvakari. Bounding the unsatisfiability threshold of random 3-SAT. Random Structures Algorithms, 17(2):103-116, 2000.
20. A. Kamath, R. Motwani, K. Palem, and P. Spirakis. Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures Algorithms. 7(1):59-80, 1995.
21. A. Kaporis, L. M. Kirousis, and E. Lalas. Personal communication. April, 2002.
22. A. Kaporis, L. M. Kirousis, Y. C. Stamatiou, M. Vamvakari, and M. Zito. The unsatisfiability threshold revisited. Disc. Math., to appear.
23. 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.
24. 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.
25. R. Monasson and R. Zecchina. Statistical mechanics of the random K-satisfiability model. Phys. Rev. E (3), 46(2): 1357-1370, 1997.
26. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
27. A. Urquhart. Hard examples for resolution. J. Assoc. Comput. Mach., 34(1):209-219, 1987.