Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q60060025, #quickstatements; #temporary_batch_1705750702424 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60060025 / rank | |||
Normal rank | |||
Revision as of 12:45, 20 January 2024
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
