People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances
De Haan, Ronald
,
Kanj, Iyad
,
Stefan Szeider
January 2017
PDF
Cite
DOI
Type
Journal Article
Xtract
Stefan Szeider
Head of Research Unit
Stefan Szeider is a Professor at the Algorithms and Complexity Group.
Cite
×