Satisfiability of Acyclic and Almost Acyclic CNF Formulas

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
January 2010
bib

Abstract

Full Citation:

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider. Satisfiability of Acyclic and Almost Acyclic CNF Formulas. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India (Kamal Lodaya, Meena Mahajan, eds.), volume 8 of LIPIcs, pages 84-95, 2010, Leibniz-Zentrum fuer Informatik.

Type
Conference Paper
Stefan Szeider
Stefan Szeider
Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.