People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Satisfiability of acyclic and almost acyclic CNF formulas
Sebastian Ordyniak
,
Stefan Szeider
January 2013
Cite
DOI
Type
Journal Article
Stefan Szeider
Head of Research Unit
Stefan Szeider is a Professor at the Algorithms and Complexity Group.
Cite
×