Improving exhaustive search implies superpolynomial lower bounds (Q2848219)
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 6211602
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving exhaustive search implies superpolynomial lower bounds |
scientific article; zbMATH DE number 6211602 |
Statements
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
Improving exhaustive search implies superpolynomial lower bounds (English)
0 references
