People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)
Sebastian Ordyniak
,
Daniƫl Paulusma
,
Stefan Szeider
January 2011
Cite
DOI
Type
Conference Paper
Stefan Szeider
Head of Research Unit
Stefan Szeider is a Professor at the Algorithms and Complexity Group.
Cite
×