Improving exhaustive search implies superpolynomial lower bounds (Q2875149)
From MaRDI portal
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use this page instead for the normal view: Improving exhaustive search implies superpolynomial lower bounds
scientific article; zbMATH DE number 6330062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving exhaustive search implies superpolynomial lower bounds |
scientific article; zbMATH DE number 6330062 |
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
0.9864749312400818
0 references
0.7532532215118408
0 references
0.7532532215118408
0 references
0.7267575263977051
0 references
