Mutilated chessboard problem is exponentially hard for resolution (Q1884991): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/tcs/Alekhnovich04, #quickstatements; #temporary_batch_1741984102478
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57532686 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / 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
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/Alekhnovich04 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:30, 14 March 2025

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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references