## If NP languages are hard on the worst-case then it is easy to find their hard instances (2005)

### Cached

### Download Links

- [www.cs.haifa.ac.il]
- [www-math.mit.edu]
- [www-math.mit.edu]
- [www.cs.haifa.ac.il]
- [cs.haifa.ac.il]
- [cs.haifa.ac.il]
- [www.cs.tau.ac.il]
- [www.math.tau.ac.il]
- DBLP

### Other Repositories/Bibliography

by
Danny Gutfreund
,
Ronen Shaltiel
,
Amnon Ta-Shma

Venue: | PROCEEDINGS OF THE 20TH ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, (CCC) |

Citations: | 16 - 5 self |