Random k-SAT: Two moments suffice to cross a sharp threshold

SIAM Journal on Computing

Volumn 36, Issue 3, 2006, Pages 740-762

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

^a University of California Santa Cruz   (United States)

^b University of New Mexico   (United States)

^c SANTA FE INSTITUTE   (United States)

Author keywords

Phase transitions; Random formulas; Satisfiability

Indexed keywords

CONSTRAINT DENSITY; RANDOM FORMULAS;

BOUNDARY CONDITIONS; CONSTRAINT THEORY; GRAPH THEORY; METHOD OF MOMENTS; PHASE TRANSITIONS; THEOREM PROVING;

PROBLEM SOLVING;

EID: 34250892621     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703434231     Document Type: Article

References (53)

1. D. ACHLIOPTAS, Setting two variables at a time yields a new lower bound for random 3-SAT, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 28-37.
2. D. ACHLIOPTAS, P. BEAME, AND M. MOLLOY, A sharp threshold in proof complexity, J. Comput. System Sci., 68 (2004), pp. 238-268.
3. D. ACHLIOPTAS, P. BEAME, AND M. MOLLOY, Exponential bounds for DPLL below the satisfiability threshold, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, 2004, pp. 132-133.
4. D. ACHLIOPTAS AND C. MOORE, The asymptotic order of the random k-SAT threshold, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. pp. 779-788.
5. D. ACHLIOPTAS AND C. MOORE, On the 2-colorability of random hypergraphs, in Randomization and Approximation Techniques in Computer Science, Lecture Notes in Comput. Sci. 2483, Springer-Verlag, Berlin, 2002, pp. 78-90.
6. D. ACHLIOPTAS, J. H. KIM, M. KRIVELEVICH, AND P. TETALI, Two-coloring random hypergraphs, Random Structures Algorithms, 20 (2002), pp. 249-259.
7. k ln 2 - O(k), J. Amer. Math. Soc., 17 (2004), pp. 947-973.
8. D. ACHLIOPTAS, A. NAOR, AND Y. PERES, On the maximum satisfiability of random formulas, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 362-370.
9. D. ACHLIOPTAS AND A. NAOR, On the k-colorability threshold, Ann. of Math. (2), 162 (2005), pp. 1333-1349.
10. D. ACHLIOPTAS AND C. MOORE, The chromatic number of random regular graphs, in Proceedings of the 8th International Workshop on Randomization and Computation, Lecture Notes in Comput. Sci. 3122, Springer-Verlag, Berlin, 2004, pp. 219-228.
11. D. ACHLIOPTAS AND G. B. SORKIN, Optimal myopic algorithms for random 3-SAT, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 590-600.
12. N. ALON AND J. SPENCER, A Note on Coloring Random k-Sets, manuscript.
13. N. ALON AND J. SPENCER, The Probabilistic Method, Wiley & Sons, New York, 1992.
14. J. BECK, On 3-chromatic hypergraphs, Discrete Math., 24 (1978), pp. 127-137.
15. F. BERNSTEIN, Zur theorie der trigonometrische reihe, Leipz. Ber., 60 (1908), pp. 325-338.
16. A. Z. BRODER, A. M. FRIEZE, AND E. UPFAL, On the satisfiability and maximum satisfiability of random 3-CNF formulas, in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, 1993, pp. 322-330.
17. M.-T. CHAO AND J. FRANCO, Probabilistic analysis of two heuristics for the 3-satisfiability problem, SIAM J. Comput., 15 (1986), pp. 1106-1118.
18. 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 (1990), pp. 289-314.
19. P. CHEESEMAN, R. KANEFSKY, AND W. TAYLOR, Where the really hard problems are, in Proceedings of the 12th International Joint Conference on Artificial Intelligence, 1991, pp. 331-337.
20. V. CHVÁTAL AND B. REED, Mick gets some (the odds are on his side), in Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992, pp. 620-627.
21. V. CHVÁTAL AND E. SZEMERÉDI, Many hard examples for resolution, J. ACM, 35 (1988), pp. 759-768.
22. S. A. COOK, The complexity of theorem-proving procedures, in Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158.
23. N. G. DE BRUIJN, Asymptotic Methods in Analysis, Dover, New York, 1981.
24. O. DUBOIS AND Y. BOUFKHAD, A general upper bound for the satisfiability threshold of random r-SAT formulae, J. Algorithms, 24 (1997), pp. 395-420.
25. O. DUBOIS, Y. BOUFKHAD, AND J. MANDLER, Typical random 3-SAT formulae and the satisfiability threshold, in Electronic Colloquium on Computational Complexity 10, 2003; available online from http://www.informatik.uni-trier.de/~ley/db/journals/eccc/eccc10.html; also available in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 2000, pp. 126-127.
26. A. EL MAFTOUHI AND W. FERNANDEZ DE LA VEGA, On random 3-SAT, Combin. Probab. Comput., 4 (1995), pp. 189-195.
27. P. ERDOS, On a combinatorial problem, Nordisk Mat. Tidskr., 11 (1963), pp. 5-10.
28. P. ERDOS AND L. LOVÁSZ, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and Finite Sets, Vol. II, Colloq. Math. Soc. Janos Bolyai 10, North-Holland, Amsterdam, 1975, pp. 609-627.
29. W. FERNANDEZ DE LA VEGA, On Random 2-SAT, manuscript, 1992.
30. P. FLAJOLET, D. E. KNUTH, AND B. PITTEL, The first cycles in an evolving graph, Discrete Math., 75 (1989), pp. 167-215.
31. J. FRANCO AND M. PAULL, Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem, Discrete Appl. Math., 5 (1983), pp. 77-87.
32. E. FRIEDGUT, Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem, J. Amer. Math. Soc., 12 (1999), pp. 1017-1054.
33. A. M. FRIEZE AND S. SUEN, Analysis of two simple heuristics on a random instance of k-SAT, J. Algorithms, 20 (1996), pp. 312-355.
34. A. FRIEZE AND N. C. WORMALD, Random k-SAT: A tight threshold for moderately growing k, Combinatorica, 25 (2005), pp. 297-305.
35. A. GOERDT, A threshold for unsatisfiability, J. Comput. System Sci., 53 (1996), pp. 469-486.
36. M. HAJIAGHAYI AND G. B. SORKIN, The satisfiability threshold of random 3-SAT is at least 3.52, submitted; available online from http://www.arxiv.org/abs/math.CO/0310193.
37. A. HAKEN, The intractability of resolution, Theoret. Comput. Sci., 39 (1985), pp. 297-308.
38. S. JANSON, T. ŁUCZAK, AND A. RUCIŃSKI, Random Graphs, John Wiley & Sons, New York, 2000.
39. S. JANSON, Y. C. STAMATIOU, AND M. VAMVAKARI, Bounding the unsatisfiability threshold of random 3-SAT, Random Structures Algorithms, 17 (2000), pp. 103-116.
40. A. KAMATH, R. MOTWANI, K. PALEM, AND P. SPIRAKIS, Tail bounds for occupancy and the satisfiability threshold conjecture, Random Structures Algorithms, 7 (1995), pp. 59-80.
41. A. KAPORIS, L. M. KIROUSIS, AND E. LALAS, Selecting complementary pairs of literals, in Proceedings of LICS 2003 Workshop on Typical Case Complexity and Phase Transitions, 2003.
42. A. KAPORIS, L. M. KIROUSIS, Y. C. STAMATIOU, M. VAMVAKARI, AND M. ZITO, The unsatisfiability threshold revisited, Discrete Math., to appear.
43. M. KAROŃSKI AND T. ŁUCZAK, Random hypergraphs, in Combinatorics, Paul Erdos Is Eighty, Vol. 2 (Kesztheley, 1993), Bolyai Soc. Math. Stud. 2, Janos Bolyai Math. Soc., Budapest, 1996, pp. 283-293.
44. L. M. KIROUSIS, E. KRANAKIS, D. KRIZANC, AND Y. STAMATIOU, Approximating the unsatisfiability threshold of random formulas, Random Structures Algorithms, 12 (1998), pp. 253-269.
45. M. KRIVELEVICH AND B. SUDAKOV, The chromatic numbers of random hypergraphs, Random Structures Algorithms, 12 (1998), pp. 381-403.
46. L. LOVÁSZ, Coverings and coloring of hypergraphs, in Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, 1973, pp. 3-12.
47. M. MÉZARD, G. PARISI, AND R. ZECCHINA, Analytic and algorithmic solution of random satisfiability problems, Science, 297 (2002), pp. 812-815.
48. M. MÉZARD AND R. ZECCHINA, Random K-satisfiability: From an analytic solution to a new efficient algorithm, Phys. Rev. E (3), 66 (2002), 056126.
49. D. G. MITCHELL, B. SELMAN, AND H. J. LEVESQUE, Hard and easy distributions of SAT problems, in Proceedings of the 10th National Conference on Artificial Intelligence, 1992, pp. 459-462.
50. R. MONASSON AND R. ZECCHINA, Statistical mechanics of the random K-satisfiability model, Phys. Rev. E (3), 56 (1997), pp. 1357-1370.
51. J. RADHAKRISHNAN AND A. SRINIVASAN, Improved bounds and algorithms for hypergraph 2-coloring, Random Structures Algorithms, 16 (2000), pp. 4-32.
52. J. SCHMIDT-PRUZAN, E. SHAMIR, AND E. UPFAL, Random hypergraph coloring algorithms and the weak chromatic number, J. Graph Theory, 8 (1985), pp. 347-362.
53. A. URQUHART, Hard examples for resolution, J. ACM, 34 (1987), pp. 209-219.