Improving exhaustive search implies superpolynomial lower bounds (Q2875149): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57568006, #quickstatements; #temporary_batch_1705791795597 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57568006 / rank | |||
Normal rank |
Revision as of 01:16, 21 January 2024
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
exact algorithms
0 references
improved exponential algorithms
0 references
lower bounds
0 references
time-space tradeoffs
0 references