Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable (Q557836)

From MaRDI portal
Revision as of 10:56, 23 June 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
Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable
scientific article

    Statements

    Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable (English)
    0 references
    0 references
    0 references
    30 June 2005
    0 references