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
| 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
