Satisfiability of acyclic and almost acyclic CNF formulas

Sebastian Ordyniak, Dani{\"e}l Paulusma, Stefan Szeider
January 2013
bib DOI

Abstract

Full Citation:

Sebastian Ordyniak, Dani"el Paulusma, Stefan Szeider. Satisfiability of acyclic and almost acyclic CNF formulas. Theoretical Computer Science, volume 481, pages 85-99, 2013.

Type
Journal Article
Stefan Szeider
Stefan Szeider
Head of Research Unit

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