An algorithm for the satisfiability problem of formulas in conjunctive normal form (Q4651809)

From MaRDI portal
Revision as of 18:07, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2136074
Language Label Description Also known as
English
An algorithm for the satisfiability problem of formulas in conjunctive normal form
scientific article; zbMATH DE number 2136074

    Statements

    An algorithm for the satisfiability problem of formulas in conjunctive normal form (English)
    0 references
    0 references
    22 February 2005
    0 references
    Complexity theory
    0 references
    NP-completeness
    0 references
    CNF-SAT
    0 references
    Probabilistic algorithms
    0 references

    Identifiers