Improving Exhaustive Search Implies Superpolynomial Lower Bounds (Q2848219): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 09:46, 5 March 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
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
