Mutilated chessboard problem is exponentially hard for resolution (Q1884991)

From MaRDI portal
Revision as of 13:52, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Mutilated chessboard problem is exponentially hard for resolution
scientific article

    Statements

    title
    Mutilated chessboard problem is exponentially hard for resolution (English)
    0 references
    publication date
    27 October 2004
    0 references
    zbMATH Keywords
    Propositional proof complexity
    0 references
    Resolution
    0 references
    Lower bounds
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    03B35
    0 references
    03F20
    0 references
    05B40
    0 references
    68T15
    0 references
    zbMATH DE Number
    2111071
    0 references
    Wikidata QID
    Q57532686
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1884991&oldid=34372806"
    Powered by MediaWiki