A probabilistic algorithm for \(k\)-SAT based on limited local search and restart (Q1348911)

From MaRDI portal
Revision as of 03:13, 19 July 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
A probabilistic algorithm for \(k\)-SAT based on limited local search and restart
scientific article

    Statements

    A probabilistic algorithm for \(k\)-SAT based on limited local search and restart (English)
    0 references
    0 references
    0 references
    21 May 2002
    0 references
    satisfiability problem
    0 references
    NP-completeness
    0 references

    Identifiers