A time lower bound for satisfiability (Q2581273)

From MaRDI portal
Revision as of 05:55, 6 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
A time lower bound for satisfiability
scientific article

    Statements

    A time lower bound for satisfiability (English)
    0 references
    0 references
    0 references
    9 January 2006
    0 references
    computational complexity
    0 references
    lower bounds
    0 references
    satisfiability
    0 references
    deterministic Turing machine
    0 references
    conondeterministic machines
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references