Exponential Bounds for DPLL Below the Satisfiability Threshold

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 132-133

  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

BACKTRACKING SCHEMES; EXPONENTIAL TIME;

ALGORITHMS; ASYMPTOTIC STABILITY; BOOLEAN ALGEBRA; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

PROBABILITY;

EID: 1842473640     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. D. Achlioptas. Lower bounds for random 3-SAT via differential equations. TCS, (1-2):159-185, 2001.
2. D. Achlioptas, P. Beame, and M. Molloy, A sharp threshold in proof complexity. STOC'01, pp. 337-346.
3. kln2 - O(k). STOC'03, pp. 223-231.
4. M.-T. Chao, J. Franco. Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem. Inform. Sci., 51(3):289-314, 1990.
5. V. Chvátal, E. Szemerédi. Many hard examples for resolution. JACM, 35(4):759-768, 1988.