Improving exhaustive search implies superpolynomial lower bounds (Q2875149): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57568006, #quickstatements; #temporary_batch_1705791795597 |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: R. Ryan Williams / rank | |||
Property / author | |||
Property / author: R. Ryan Williams / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/1806689.1806723 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2007121506 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:22, 20 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