Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/tcs/FleischnerKS02, #quickstatements; #temporary_batch_1731505720702 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/tcs/FleischnerKS02 / rank | |||
Normal rank | |||
Latest revision as of 16:07, 13 November 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
0 references
0 references
