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 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Short proofs are narrow—resolution made simple / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Many hard examples for resolution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Short proofs for tricky formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regular resolution lower bounds for the weak pigeonhole principle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Resolution lower bounds for the weak pigeonhole principle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Resolution proofs of matching principles / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:52, 7 June 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