Sciweavers

Share
ECCC
2000

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

9 years 8 months ago
Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference
A formula (in conjunctive normal form) is said to be minimal unsatisfiable if it is unsatisfiable and deleting any clause makes it satisfiable. The deficiency of a formula is the difference of the number of clauses and the number of variables. It is known that every minimal unsatisfiable formula has positive deficiency. Until recently, polynomial
Herbert Fleischner, Stefan Szeider
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2000
Where ECCC
Authors Herbert Fleischner, Stefan Szeider
Comments (0)
books