Mutilated chessboard problem is exponentially hard for resolution (Q1884991)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mutilated chessboard problem is exponentially hard for resolution |
scientific article; zbMATH DE number 2111071
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mutilated chessboard problem is exponentially hard for resolution |
scientific article; zbMATH DE number 2111071 |
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
