CNF-Satisfiability Test by Counting and Polynomial Average Time (Q3829072)

From MaRDI portal
Revision as of 19:04, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
CNF-Satisfiability Test by Counting and Polynomial Average Time
scientific article

    Statements

    title
    CNF-Satisfiability Test by Counting and Polynomial Average Time (English)
    0 references
    publication date
    1989
    0 references
    zbMATH Keywords
    CNF SAT
    0 references
    average time
    0 references
    independent sets
    0 references
    backtracking
    0 references
    author
    Kazuo Iwama
    0 references

    Identifiers

    DOI
    10.1137/0218026
    0 references
    zbMATH DE Number
    4104388
    0 references
    OpenAlex ID
    W2050917944
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3829072&oldid=31455506"
    Powered by MediaWiki