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
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q62398467, #quickstatements; #temporary_batch_1706974288397 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q62398467 / rank | |||
Normal rank | |||
Revision as of 16:59, 3 February 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
