Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Paper:

TR04-041 | 18th May 2004 00:00

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

TR04-041
Authors: Michael Alekhnovich, Edward Hirsch, Dmitry Itsykson
Publication: 19th May 2004 08:34