Hard satisfiable instances for DPLL-type algorithms (Q2577593)

From MaRDI portal
Revision as of 19:44, 5 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57101178, #quickstatements; #temporary_batch_1707149277123)
scientific article
Language Label Description Also known as
English
Hard satisfiable instances for DPLL-type algorithms
scientific article

    Statements

    title
    Hard satisfiable instances for DPLL-type algorithms (English)
    0 references
    publication date
    3 January 2006
    0 references
    zbMATH Keywords
    propositional satisfiability problem
    0 references

    Identifiers

    zbMATH DE Number
    2242961
    0 references
    Wikidata QID
    Q57101178
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2577593&oldid=17504036"
    Powered by MediaWiki