Mutilated chessboard problem is exponentially hard for resolution (Q1884991)

From MaRDI portal
Revision as of 19:09, 8 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57532686, #quickstatements; #temporary_batch_1704736726153)
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