ECCC - TR00-049

ECCC

Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login

Register

Classic Style

REPORTS > DETAIL:

Paper:

TR00-049 | 2nd May 2000 00:00

Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference

Contact

Add Comment

TR00-049 Authors: Herbert Fleischner, Stefan Szeider
Publication: 11th July 2000 01:44
Downloads: 3331

Keywords:

atom-clause digraph, augmenting path, conjunctive normal form, matchings, minimal unsatisfiable formulas, polynomial time recognition

Abstract:

ISSN 1433-8092 | Imprint