Improving exhaustive search implies superpolynomial lower bounds (Q2875149)

From MaRDI portal
Revision as of 00:22, 20 March 2024 by Openalex240319060354 (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
    13 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    exact algorithms
    0 references
    improved exponential algorithms
    0 references
    lower bounds
    0 references
    time-space tradeoffs
    0 references
    0 references
    0 references
    0 references