A sharp threshold in proof complexity yields lower bounds for satisfiability search

Journal of Computer and System Sciences

Volumn 68, Issue 2, 2004, Pages 238-268

  Achlioptas, Dimitris ^a   Beame, Paul ^b   Molloy, Michael ^c  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; PROBABILITY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

DAVIS-PUTNAM ALGORITHM; SATISFIABILITY SEARCH;

COMPUTATIONAL COMPLEXITY;

EID: 1842458396     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2003.07.011     Document Type: Article

References (36)

1. D. Achlioptas, Threshold Phenomena in random graph coloring and satisfiability, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1999.
2. D. Achlioptas, Setting 2 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, Portland, OR, May 2000, pp. 28-37.
3. D. Achlioptas, A survey of lower bounds for random 3-SAT via differential equations, Theoret. Comput. Sci. 265 (1-2) (2001) 159-185.
4. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, Rigorous results for random (2 + p)-SAT, Theoret. Comput. Sci. 265 (1-2) (2001) 109-129.
5. k ln 2 - O(k), in: 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, 2003, 223-231.
6. D. Achlioptas, G.B. Sorkin, Optimal myopic algorithms for random 3-SAT, in: 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, IEEE Press, New York, 2000, pp. 590-600.
7. N. Alon, J.H. Spencer, P. Erdös, The Probabilistic Method, Wiley, New York, 1992.
8. P. Beame, R. Karp, T. Pitassi, M. Saks, On the complexity of unsatisfiability of random k-CNF formulas, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, May 1998, pp. 561-571.
9. E. Ben-Sasson, A. Wigderson, Short proofs are narrow - resolution made simple, J. ACM 48 (2) (2001) 149-169.
10. A. Biere, A. Cimatti, E. Clarke, Y. Zhu, Symbolic model checking without BDDs, in: Proceedings, Fifth International Conference, TACAS'99, Springer, Berlin, Germany, 1999, pp. 193-207.
11. B. Bollobás, Random Graphs, Academic Press, London, New York, 1985.
12. B. Bollobás, C. Borgs, J.T. Chayes, J.H. Kim, D.B. Wilson, The scaling window of the 2-SAT transition, Random Struct. Algorithms 18 (3) (2001) 201-256.
13. M.T. Chao, J. Franco, Probabilistic analysis of a generalization of the unit-clause literal selection heuristics, Inform. Sci. 51 (1990) 289-314.
14. V. Chvátal, B. Reed, Mick gets some (the odds are on his side), in: Proceedings 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, IEEE Press, New York, October 1992, pp. 620-627.
15. V. Chvátal, E. Szemerédi, Many hard examples for resolution, J. ACM 35 (4) (1988) 759-768.
16. C. Coarfa, D.D. Demopoulos, A. San Miguel Aguirre, D. Subramanian, M. Y. Vardi, Random 3-SAT: the plot thickens, in: Proceedings Sixth International Conference on Principles and Practice of Constraint Programming, Singapore, September 2000.
17. S. Cocco, R. Monasson, Trajectories in phase diagrams, growth processes and computational complexity: how search algorithms solve the 3-satisfiability problem, Phys. Rev. Lett. 86 (8) (2001) 1654-1657.
18. M. Davis, G. Logemann, D. Loveland, A machine program for theorem proving, Comm. ACM 5 (1962) 394-397.
19. M. Davis, H. Putnam, A computing procedure for quantification theory, Comm. ACM 7 (1960) 201-215.
20. W. Fernandez de la Vega, On random 2-SAT, manuscript, 1992.
21. E. Friedgut, Sharp thresholds of graph properties, and the k-sat problem, J. Amer. Math. Soc. 12 (1999) 1017-1054.
22. A. Frieze, S. Suen, Analysis of two simple heuristics on a random instance of k-SAT, J. Algorithms 20 (2) (1996) 312-355.
23. A. Goerdt, A threshold for unsatisfiability, J. Comput. System Sci. 53 (1996) 469-486.
24. C.P. Gomes, B. Selman, N. Crato, H. Kautz, Heavy-tailed phenomena in satisfiability and constraint satisfaction problems, J. Automat. Reason. 24 (1-2) (2000) 67-100.
25. C. Gomes, B. Selman, H. Kautz, Boosting combinatorial search through randomization, in: Proceedings 15th National Conference on Artificial Intelligence (AAAI-98), Madison, WI, 1998, pp. 431-437.
26. S. Janson, Y.C. Stamatiou, M. Vamvakari, Bounding the unsatisfiability threshold of random 3-SAT, Random Struct. Algorithms 17 (2) (2000) 103-116.
27. H. Kautz, D. McAllester, B. Selman, Encoding plans in propositional logic, in: Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR'96), Cambridge, MA, 1996, pp. 374-384.
28. H. Kautz, B. Selman, Pushing the envelope: planning, propositional logic, and stochastic research, in: Proceedings of the 13th AAAI, Portland, OR, 1996, pp. 1194-2001.
29. S. Kirkpatrick, B. Selman, Critical behavior in the satisfiability of random formulas, Science 264 (1994) 1297-1301.
30. C.J.H. McDiarmid, On the method of bounded differences, in: Surveys in Combinatorics, Proceedings of the 12th British Combinatorial Conference, Cambridge University Press, Cambridge, 1989, pp. 148-188.
31. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, L. Troyansky, Phase transition and search cost in the (2 + p)-SAT problem, in: Fourth Workshop on Physics and Computation, Boston, MA, 1996.
32. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, L. Troyansky, 2 + p-SAT: relation of typical-case complexity to the nature of the phase transition, Random Struct. Algorithms 15 (3-4) (1999) 414-435.
33. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, L. Troyansky, Determining computational complexity from characteristic phase transitions, Nature 400 (1999) 133-137.
34. B. Selman, H. Kautz, Domain-independent extensions to GSAT: solving large structured satisfiability problems, in: Proceedings of the 13th IJCAI, Chambéry, France, 1993, pp. 290-295.
35. B. Selman, H. Levesque, D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings Tenth National Conference on Artificial Intelligence (AAAI-92), San Diego, CA, 1992, pp. 440-446.
36. B. Selman, D. Mitchell, H. Levesque, Generating hard satisfiability problems, Artif. Intell. 81 (1996) 17-29.