Improving Exhaustive Search Implies Superpolynomial Lower Bounds (Q2848219): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/10080703x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004130530 / rank | |||
Normal rank | |||
Latest revision as of 08:26, 30 July 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
