Algorithms for Sat and upper bounds on their complexity (Q2487388)

From MaRDI portal
Revision as of 05:24, 5 August 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
Algorithms for Sat and upper bounds on their complexity
scientific article

    Statements

    Algorithms for Sat and upper bounds on their complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 2005
    0 references
    propositional satisfiability problem
    0 references

    Identifiers