Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Abstract
Stefan Szeider. Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Proceedings of the 9th International Computing and Combinatorics Conference (COCOON'03) (T. Warnow and B. Zhu), volume 2697 of Lecture Notes in Computer Science, pages 548-558, 2003, Springer Verlag.
Type
Stefan Szeider
Head of Research Unit
Stefan Szeider is a Professor at the Algorithms and Complexity Group.