The scaling window of the 2-SAT transition

Random Structures and Algorithms

Volumn 18, Issue 3, 2001, Pages 201-256

  Bollobás, Béla ^b,c   Borgs, Christian ^a   Chayes, Jennifer T ^a   Kim, Jeong Han ^a   Wilson, David B ^a  

^a MICROSOFT RESEARCH   (United States)

^b University of Memphis   (United States)

^c TRINITY COLLEGE   (United Kingdom)

Author keywords

2 SAT; Backbone; Constraint satisfaction problem; Critical exponents; Finite size scaling; Order parameter; Phase transition; Random graph; Satisfiability; Spine

Indexed keywords

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

References (69)

1. D. Achlioptas, Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract), Proc. 32nd ACM Symposium on Theory of Computing, (2000), pp. 28-37.
2. D. J. Aldous. A random walk construction of uniform spanning trees and uniform labelled trees, SIAM J Discrete Math, 3 (1990), 450-465.
3. D. Achlioptas and M. Molloy, personal communication (1998).
4. B. Aspvall, M. F. Plass, and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Inform Process Lett 8 (1979), 121-123.
5. N. Alon and J. Spencer. The Probabilistic Method, John Wiley & Sons, New York 1992.
6. D. Achlioptas and G. B. Sorkin, Optimal myopic algorithms for random 3-SAT, Proc. 41st Symp the Foundations of Computer Science, 2000, pp. 590-600.
7. B. Bollobás, C. Borgs, J. T. Chayes, and J. H. Kim, Lecture at the Workshop on the Interface between Statistical Physics and Computer Science, Torino, Italy, (1998) unpublished.
8. B. Bollobás, C. Borgs, J. T. Chayes, J. H. Kim, and D. B. Wilson, Critical exponents of the 2-SAT transition, in preparation (2000).
9. C. Borgs, J. T. Chayes, H. Kesten, and J. Spencer, Uniform boundedness of critical crossing probabilities implies hyperscaling, Random Structures Algorithms (to appear).
10. C. Borgs, J. T. Chayes, H. Kesten, and J. Spencer, Birth of the infinite cluster: Finite-size scaling in percolation, preprint (1998).
11. E. A. Bender, E. R. Canfield and B. D. McKay, The asymptotic number of labeled connected graphs with a given number of vertices and edges, Random Structures Algorithms 1 (1990), 127-169.
12. A. Broder, A. Frieze, and E. Upfal, On the satisfiability and maximum satisfiability of random 3-CNF formulas, Proc 4th ACM-SIAM Symp Discrete Algorithms, 1993, pp. 322-330.
13. B. Bollobás, The evolution of random graphs, Trans Amer Math Soc 286 (1984), 257-274.
14. B. Bollobás. Random Graphs, Academic Press, London, 1985.
15. V. E. Britikov, On the random graph structure near the critical point, Discrete Math. Appl., 1 (1991), 301-309 [Diskret Mat 1 (1989), 121-128].
16. V. E. Britikov, On the random graph structure near the critical point, Discrete Math. Appl., 1 (1991), 301-309 [Diskret Mat 1 (1989), 121-128].
17. J. M. Crawford and L. D. Auton, Experimental results on the crossover point in satisfiability problems, Proc. 11th Natl Conf Artificial Intelligence, 1993 21-27.
18. M. T. Chao and J. Franco, Probabilistic analysis of two heuristics for the 3-satisfiability problem, SIAM J Comput 5 (1986), 1106-1118.
19. M. T. Chao and J. Franco, Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiable problem, Inform Sci 51 (1990), 289-314.
20. J. T. Chayes, Finite-size scaling in percolation, Proc Intl Congress of Mathematicians, Vol. III (Berlin, 1998), Doc Math Extra Vol. III (1998), 113-122.
21. J. T. Chayes, Finite-size scaling in percolation, Proc Intl Congress of Mathematicians, Vol. III (Berlin, 1998), Doc Math Extra Vol. III (1998), 113-122.
22. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann Math Stat 23 (1952), 493-507.
23. S. A. Cook, The complexity of theorem-proving procedures, Proc. 3rd ACM Symp Theory of Computing, 1971 pp. 151-158.
24. J. T. Chayes, A. Puha, and T. Sweet, Independent and dependent percolation, Probability theory and applications (Princeton, NJ, 1996), in IAS/Park City Math Ser Vol 6, Amer Math Soc, Providence, RI 1999, pp. 49-166.
25. V. Chvátal and B. Reed, Mick gets some (the odds are on his side), Proc. 33rd Symp Foundations of Computer Science, 1992, pp. 620-627.
26. V. Chvátal and E. Szemerédi, Many hard examples for resolution, JACM 35 (1988), 759-768.
27. O. Dubois and Y. Boufkhad, A general upper bound for the satisfiablity threshold of random k-SAT formulas, J Algorithms 24 (1997), 395-420.
28. O. Dubois, Y. Boufkhad, and J. Mandler, Typical random 3-SAT formulae and the satisfiability threshold, Research announcement at ICTP, Sept 1999; Two-page abstract appears in Proc 11th ACM-SIAM Symp on Discrete Algorithms, 2000, pp. 126-127.
29. O. Dubois, Y. Boufkhad, and J. Mandler, Typical random 3-SAT formulae and the satisfiability threshold, Research announcement at ICTP, Sept 1999; Two-page abstract appears in Proc 11th ACM-SIAM Symp on Discrete Algorithms, 2000, pp. 126-127.
30. O. Dubois, Counting the number of solutions for instances of satisfiability, Theoret Comput Sci 81 (1991), 49-64.
31. A. El Maftouhi and W. Fernandez de la Vega, On random 3-sat, Combin Probab Comput 4 (1995), 189-195.
32. P. Erdos and A. Rényi, On the evolution of random graphs, Magyar Tud Akad Mat Kutató Int Közl 5 (1960), 17-61.
33. P. Erdos and A. Rényi, On the evolution of random graphs, Bull Inst Internat Statist 38 (1961), 343-347.
34. E. Friedgut, with appendix by J. Bourgain, Sharp thresholds of graph properties, and the k-sat problem, J Amer Math Soc 12 (1999), 1017-1054.
35. W. Feller, An Introduction to Probability Theory and Its Applications, Volume I, 3rd Ed., John Wiley & Sons, London, 1968.
36. W. Fernandez de la Vega, On random 2-SAT, unpublished manuscript (1992).
37. W. Fernandez de la Vega, On random 2-SAT (revised version), preprint (1998).
38. C. M. Fortuin, P. W. Kasteleyn, and J. Ginibre, Correlation inequalities on some partially ordered sets, Commun Math Phys 22 (1971), 89-103.
39. J. Franco and M. Paul, Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem, Discrete Applied Mathematics 5 (1983), 77-87.
40. A. Frieze and S. Suen, Analysis of two simple heuristics for a random instance of K-SAT, J Algorithms 20 (1996), 312-335.
41. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979.
42. M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret Comput Sci 1 (1976), 237-267.
43. A. Goerdt, A threshold for unsatisfiability, Mathematical Foundations of Computer Science, 17th Intl Symposium, I.M. Havel and V. Koubek, Eds., Lecture Notes in Computer Science No. 629, Springer Verlag, Berlin (1992), 264-274.
44. A. Goerdt, A threshold for unsatisfiability, J Compute System Sci 53 (1996), 469-486.
45. A. Goerdt, A remark on random 2-SAT, Discrete Appl Math 96-97 (1999), 107-110.
46. T. E. Harris, A lower bound for the critical probability in certain percolation processes, Proc Camb Philos Soc 56 (1960), 13-20.
47. J. Håstad, Some optimal in-approximability results, Proc 29th ACM Symp Theory of Computation, 1997, pp. 1-10.
48. S. Janson, Y. C. Stamatiou, and M. Vamvakari, Bounding the unsatisfiability threshold of random 3-SAT, Random Structures Algorithms 17 (2000), 103-116.
49. S. Janson, D. Knuth, T. Łuczak, and B. Pittel, The birth of the giant component, Random Structures Algorithms 4 (1994), 231-358.
50. R. M. Karp. The transitive closure of a random digraph, Random Structures Algorithms 1 (1990), 73-93.
51. L. Kirousis, E. Kranakis, and D. Krizanc, Approximating the unsatisfiability threshold of random formulas, Proc. 4th European Symposium on Algorithms, 1996, pp. 27-38.
52. D. J. Kleitman, Families of non-disjoint subsets, J Combin Theory 1 (1966), 153-155.
53. A. Kamath, R. Motwani, K. Palem, and P. Spirakis. Tail bounds for occupancy and the satisfiability threshold conjecture, Random Structures Algorithms 7 (1995), 59-89.
54. S. Kirkpatrick and B. Selman, Critical behavior in the satisfiability of random Boolean expressions, Science 264 (1994), 1297-1301.
55. T. Łuczak, B. Pittel, and J. C. Wierman, The structure of a random graph at the point of the phase trasnsition, Trans Amer Math Soc 341 (1994), 721-748.
56. T. Larrabee and Y. Tsuji, Evidence for satisfiability threshold for random 3CNF formulas, Proc. AAAI Symposium on Artificial Intelligence and NP-Hard Problems, 1993, p. 112.
57. T. Łuczak, Component behavior near the critical point of the random graph process, Random Structures Algorithms 1 (1990), 287-310.
58. C. McDiarmid, On the method of bounded differences, in Surveys in Combinatorics, 1989, pp. 148-188.
59. M. Mézard, G. Parisi, and M. A. Virasoro, Spin Glass Theory and Beyond, World Scientific, Singapore, 1987.
60. D. Mitchell, B. Selman, and H. Levesque, Hard and easy distributions of SAT problems, Proc 10th Natl Conf Artificial Intelligence, 1992, pp. 459-465.
61. R. Monasson and R. Zecchina, The entropy of the K-satisfiability problem, Phys Rev Lett 76 (1996), 3881.
62. R. Monasson and R. Zecchina, Statistical mechanics of the random K-SAT model, Phys Rev E 56 (1997), 1357-1370.
63. 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 Structures Algorithms 15 (1999), 414-435.
64. B. Selman and S. Kirkpatrick, Critical behavior in the computational cost of satisfiability testing, Artificial Intelligence 81 (1996), 273-295.
65. Y. Verhoeven, Random 2-SAT and unsatisfiability, Inf Process Lett 72 (1999), 119-123.
66. D. B. Wilson, http://dbwilson.com/2sat-data/ (1998).
67. D. B. Wilson, The empirical values of the critical k-SAT exponents are wrong. Preprint math.PR/0005136 (2000).
68. E. M. Wright, The number of connected sparsely edged graphs, J Graph Theory 1 (1977), 317-330.
69. E. M. Wright, The number of connected sparsely edged graphs III. Asymptotic results, J Graph Theory 4 (1980), 393-407.