On the Critical Exponents of Random k-SAT

Random Structures and Algorithms

Volumn 21, Issue 2, 2002, Pages 182-195

  Wilson, David B ^a  

^a NONE   (United States)

Author keywords

Critical exponent; Satisfiability; Threshold

Indexed keywords

EID: 0036355954     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10050     Document Type: Article

References (28)

1. D. Achlioptas and E. Friedgut, A sharp threshold for k-colorability, Random Struct Alg 14(1) (1999), 63-70.
2. D. Achlioptas and C. Moore, Almost all graphs with average degree 4 are 3-colorable, Proc 34th ACM Symp Theory Comput 2002, pp. 199-208.
3. D. Achlioptas and C. Moore, The asymptotic order of the k-SAT threshold, manuscript, 2002.
4. B. Bollobás, C. Borgs, J. T. Chayes, and J. H. Kim, presented at the Workshop on the Interface between Statistical Physics and Computer Science, Torino, Italy, 1998.
5. B. Bollobás, C. Borgs, J. T. Chayes, J. H. Kim, and D. B. Wilson, The scaling window of the 2-SAT transition, Random Struct Alg 18(3) (2001), 201-256 (arXiv:math.CO/9909031).
6. J. T. Chayes, L. Chayes, D. S. Fisher, and T. Spencer, Finite-size scaling and correlation lengths for disordered systems, Phys Rev Lett 57(24) (1986), 2999-3002.
7. J. T. Chayes, L. Chayes, D. S. Fisher, and T. Spencer, Correlation length bounds for disordered Ising ferromagnets, Commun Math Phys 120(3) (1989), 501-523.
8. V. Chvátal and B. Reed, Mick gets some (the odds are on his side), Proc 33rd Symp Found Comput Sci, 1992, pp. 620-627.
9. J. M. Crawford and L. D. Auton, Experimental results on the crossover point in satisfiability problems, 11th Nat Conf Artif Intell (AAAI-93), 1993, pp. 21-27.
10. J. M. Crawford and L. D. Auton, Experimental results on the crossover point in random 3SAT, Artif Intell 81(1-2) (1996), 59-80.
11. O. Dubois, Y. Boufkhad, and J. Mandler, Typical random 3-SAT formulae and the satisfiability threshold, Proc 11th ACM-SIAM Symp Discrete Alg, 2000, pp. 126-127.
12. E. Friedgut, Sharp thresholds of graph properties, and the k-SAT problem, J Am Math Soc 12(4) (1999), 1017-1054. (with an appendix by Jean Bourgain).
13. I. P. Gent and T. Walsh, The SAT phase transition, In A. Cohn, editor, 11th Eur Conf Artif Intell, Wiley, New York, 1994, pp. 105-109.
14. G. Grimmett, Percolation, Springer-Verlag, New York, 1989.
15. B. Hayes, Can't get no satisfaction, Am Sci 85(2) (1997), 108-112.
16. A. C. Kaporis, L. M. Kirousis, and E. G. Lalas, The probabilistic analysis of a greedy satisfiability algorithm, presented at the European Symposium of Algorithms, 2002.
17. A. C. Kaporis, L. M. Kirousis, and Y. C. Stamatiou, A note on the non-colorability threshold of a random graph, Electronic J Combinatorics 7(1) (2000), Paper #R29.
18. A. C. Kaporis, L. M. Kirousis, Y. C. Stamatiou, M. Vamvakari, and M. Zito, The unsatisfiability threshold revisited, manuscript, 2001.
19. S. Kirkpatrick, personal communication, 2000.
20. S. Kirkpatrick and B. Selman, Critical behavior in the satisfiability of random Boolean expressions, Science 264 (1994), 1297-1301.
21. S. Kirkpatrick, G. Györgyi, N. Tishby, and L. Troyansky, "The statistical mechanics of k-satisfaction," Advances in neural information processing systems, J.D. Cowan, G. Tesauro, and J. Alspector (Editors), Morgan Kaufmann, San Francisco, CA, 1993, Vol. 6, pp. 439-446.
22. T. Łuczak, The chromatic number of random graphs, Combinatorica 11(1) (1991), 45-54.
23. D. Mitchell, B. Selman, and H. Levesque, Hard and easy distributions of SAT problems, Proc 10th Nat Conf Artif Intell 1992, pp. 459-465.
24. R. Monasson and R. Zecchina, Informal talk on the replica method and 2-SAT, 1998.
25. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, 2 + p-SAT: Relation of typical-case complexity to the nature of the phase transition, Random Struct Alg 15(3-4) (1999), 414-435.
26. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, Determining computational complexity from characteristic "phase transitions," Nature 400 (1999), 133-137.
27. B. Pittel, J. Spencer, and N. Wormald, Sudden emergence of a giant k-core in a random graph, J Combinat Theory Ser B 67(1) (1996), 111-151.
28. B. Selman and S. Kirkpatrick, Critical behavior in the computational cost of satisfiability testing, Artif Intell 81(1-2) (1996), 273-295.