Improving exhaustive search implies superpolynomial lower bounds (Q2875149): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 09:52, 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
13 August 2014
0 references
exact algorithms
0 references
improved exponential algorithms
0 references
lower bounds
0 references
time-space tradeoffs
0 references
