Mutilated chessboard problem is exponentially hard for resolution (Q1884991): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57532686, #quickstatements; #temporary_batch_1704736726153 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:06, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mutilated chessboard problem is exponentially hard for resolution |
scientific article |
Statements
Mutilated chessboard problem is exponentially hard for resolution (English)
0 references
27 October 2004
0 references
Propositional proof complexity
0 references
Resolution
0 references
Lower bounds
0 references
