On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances (bibtex)
by , ,
Reference:
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP InstancesRonald de Haan, Iyad Kanj, Stefan Szeider2017, Technical report AC-TR-17-009, Algorithms and Complexity Group, TU Wien.
Bibtex Entry:
@TechReport{DeHaanKanjSzeider,
author    = {Ronald de Haan and Iyad Kanj and Stefan Szeider},
title       = {On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances},
institution  = {Algorithms and Complexity Group, TU Wien},
year 	       = {2017},
number    = {AC-TR-17-009},
url = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-17-009.pdf},
}