Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549)

From MaRDI portal
Revision as of 06:00, 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
Typical case complexity of satisfiability algorithms and the threshold phenomenon
scientific article

    Statements

    Typical case complexity of satisfiability algorithms and the threshold phenomenon (English)
    0 references
    0 references
    10 January 2006
    0 references
    Satisfiability
    0 references
    Threshold
    0 references
    Probabilistic analysis
    0 references
    \(k\)-CNF
    0 references

    Identifiers