Mutilated chessboard problem is exponentially hard for resolution (Q1884991): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57532686, #quickstatements; #temporary_batch_1704736726153 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57532686 / rank | |||
Normal rank | |||
Revision as of 19:09, 8 January 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
