The Local Lemma Is Asymptotically Tight for SAT (Q3177819)

From MaRDI portal
Revision as of 11:08, 12 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q124807321, #quickstatements; #temporary_batch_1723453003539)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Local Lemma Is Asymptotically Tight for SAT
scientific article

    Statements

    The Local Lemma Is Asymptotically Tight for SAT (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    local lemma
    0 references
    extremal combinatorics
    0 references
    satisfiability of \(k\)-CNF formulas
    0 references
    0 references
    0 references
    0 references