On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances

Abstract

Full Citation:

Ronald de Haan, Iyad Kanj, Stefan Szeider. On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. 2017, Technical report AC-TR-17-009, Algorithms and Complexity Group, TU Wien.

Stefan Szeider

Head of Research Unit

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