If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
| Image |  |
|---|---|
| Description | article by Dan Gutfreund et al published December 2007 in Computational Complexity |
| Author/s |
author: Ronen Shaltiel Dan Gutfreund |
| Publication date | December 2007 |
| Language | |
| Country of origin | |
| Wikipedia link | |
| Copyright status | |
| Missing/wrong data? | Edit Wikidata item |