Parameterized Complexity of DPLL Search Procedures

Olaf Beyersdorff, Nicola Galesi, Massimo Lauria. Parameterized Complexity of DPLL Search Procedures. In Karem A. Sakallah, Laurent Simon, editors, Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings. Volume 6695 of Lecture Notes in Computer Science, pages 5-18, Springer, 2011. [doi]

Abstract

Abstract is missing.