If NP languages are hard on the worst-case, then it is easy to find their hard instances (Q2475580): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q62398467, #quickstatements; #temporary_batch_1706974288397 |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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.1007/s00037-007-0235-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2163083173 / rank | |||
Normal rank | |||
Revision as of 19:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | If NP languages are hard on the worst-case, then it is easy to find their hard instances |
scientific article |
Statements
If NP languages are hard on the worst-case, then it is easy to find their hard instances (English)
0 references
11 March 2008
0 references
Average-case complexity
0 references
worst-case to average-case reductions
0 references
foundations of cryptography
0 references
pseudo classes
0 references
