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. In Josep Díaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella, editors, Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings. Volume 3142 of Lecture Notes in Computer Science, pages 84-96, Springer, 2004. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.