Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. |
scientific article |
Statements
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (English)
0 references
21 January 2003
0 references
Minimal unsatisfiable
0 references
SAT
0 references
Deficiency
0 references
Matching
0 references
Autarky
0 references
Polynomial time algorithm
0 references
