Deterministic versus nondeterministic time and lower bound problems (Q3455557)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Deterministic versus nondeterministic time and lower bound problems
scientific article

    Statements

    Deterministic versus nondeterministic time and lower bound problems (English)
    0 references
    0 references
    7 December 2015
    0 references
    computational complexity
    0 references
    NP-completeness
    0 references
    SAT
    0 references
    generic algorithms
    0 references
    generic problems
    0 references
    nondeterminism
    0 references
    power index
    0 references
    time complexity
    0 references

    Identifiers

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