Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 84-96

  Alekhnovich, Michael ^a   Hirsch, Edward A ^b   Itsykson, Dmitry ^c  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^c ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; TREES (MATHEMATICS);

BRANCHING HEURISTICS; CONTEMPORARY ALGORITHMS; DPLL ALGORITHM; MYOPIC ALGORITHM; PROPOSITIONAL SATISFIABILITY PROBLEMS; RECURSION TREES; RESOLUTION PROOFS; UNSATISFIABLE FORMULAS;

ALGORITHMS;

EID: 35048869086     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_10     Document Type: Article

References (15)

1. D. Achlioptas, P. Beame, and M. Molloy. A sharp threshold in proof complexity. JCSS, 2003.
2. D. Achlioptas, P. Beame, and M. Molloy. Exponential bounds for DPLL below the satisfiability threshold. In SODA'04, 2004.
3. D. Achlioptas and G. B. Sorkin. Optimal myopic algorithms for random 3-SAT. In FOCS'00, 2000.
4. M. Alekhnovich and E. Ben-Sasson. Analysis of the random walk algorithm on random 3-CNFs. Manuscript, 2002.
5. M. Alekhnovich, E. Ben-Sasson, A. Razborov, and A. Wigderson. Pseudorandom generators in prepositional complexity. In FOCS'00, 2000. Journal version is to appear in SIAM J. Comp.
6. M. Alekhnovich and A. Razborov. Lower bounds for the polynomial calculus: non-binomial case. In FOCS'01, 2001.
7. E. Ben-Sasson and A. Wigderson. Short proofs are narrow - resolution made simple. JACM, 48(2):149-169, 2001.
8. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Comm. ACM, 5:394-397, 1962.
9. M. Davis and H. Putnam. A computing procedure for quantification theory. JACM, 7:201-215, 1960.
10. E. A. Hirsch. SAT local search algorithms: Worst-case study. JAR, 24(1/2):127-143, 2000.
11. S. I. Nikolenko. Hard satisfiable formulas for DPLL-type algorithms. Zapiski nauchnyh seminarov POMI, 293:139-148, 2002.
12. English translation is to appear in Journal of Mathematical Sciences.
13. P. Pudlák and R. Impagliazzo. A lower bound for DLL algorithms for k-SAT. In SODA'00, 2000.
14. L. Simon, D. Le Berre, and E. A. Hirsch. The SAT 2002 Competition. To appear in AMAI, 2002.
15. G. S. Tseitin. On the complexity of derivation in the propositional calculus. Zapiski nauchnykh seminarov LOMI, 8:234-259, 1968. English translation of this volume: Consultants Bureau, N.Y., 1970, pp. 115-125.