Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances
Ronald De Haan
,
Iyad Kanj
,
Stefan Szeider
January 2017
PDF
Cite
Type
Technical Report
Stefan Szeider
Head of Research Unit
Stefan Szeider is a Professor at the Algorithms and Complexity Group.
Cite
×