Hard satisfiable instances for DPLL-type algorithms (Q2577593)

From MaRDI portal
Revision as of 06:10, 6 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2577593&oldid=2900883"
      Powered by MediaWiki