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 the normal view instead:
scientific article; zbMATH DE number 1857075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. |
scientific article; zbMATH DE number 1857075 |
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
0 references
0 references
0.8892991542816162
0 references
0.8821298480033875
0 references
0.8748469948768616
0 references
0.8451614379882812
0 references
0.8449357151985168
0 references
