Improving Exhaustive Search Implies Superpolynomial Lower Bounds (Q2848219)

From MaRDI portal
Revision as of 08:26, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
scientific article

    Statements

    Improving Exhaustive Search Implies Superpolynomial Lower Bounds (English)
    0 references
    25 September 2013
    0 references
    lower bounds
    0 references
    improved exponential algorithms
    0 references
    exact algorithms
    0 references
    time-space trade-offs
    0 references
    circuit complexity
    0 references
    0 references

    Identifiers