On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances
Abstract
de Haan, Ronald, Kanj, Iyad, Szeider, Stefan. On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances. ACM Transactions on Computational Logic, volume 18, number 3, pages Art. 21, 46, 2017.
Type
Stefan Szeider
Head of Research Unit
Stefan Szeider is a Professor at the Algorithms and Complexity Group.