Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference

Abstract

Full Citation:

Fleischner, Herbert, Kullmann, Oliver, Szeider, Stefan. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoretical Computer Science, volume 289, number 1, pages 503-516, 2002.

Stefan Szeider

Head of Research Unit

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