Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

Abstract

Full Citation:

Stefan Szeider. Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. 2003, Technical report TR03-002, Revision~1, Electronic Colloquium on Computational Complexity (ECCC).

Stefan Szeider

Head of Research Unit

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