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

Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. Electronic Colloquium on Computational Complexity (ECCC), (041), 2004. [doi]

Abstract

Abstract is missing.