The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410)

From MaRDI portal
Revision as of 16:58, 3 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56767456, #quickstatements; #temporary_batch_1706974288397)
scientific article
Language Label Description Also known as
English
The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs
scientific article

    Statements

    The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 March 2008
    0 references
    satisfiability
    0 references
    unique satisfiability
    0 references
    \(k\)-SAT
    0 references
    subexponential time reduction
    0 references
    isolation lemma
    0 references

    Identifiers