Algorithms for four variants of the exact satisfiability problem (Q596105)

From MaRDI portal
Revision as of 19:39, 6 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for four variants of the exact satisfiability problem
scientific article

    Statements

    Algorithms for four variants of the exact satisfiability problem (English)
    0 references
    0 references
    0 references
    0 references
    10 August 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Satisfiability
    0 references
    SAT
    0 references
    Exact satisfiability
    0 references
    XSAT
    0 references
    3-Satisfiability
    0 references
    Exact
    0 references
    3-satisfiability
    0 references
    X3SAT
    0 references
    Counting
    0 references
    Counting problem
    0 references
    Counting models
    0 references
    Algorithm
    0 references
    Exact solution
    0 references
    Exponential-time algorithm
    0 references
    Computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references