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

by Danny Gutfreund , Ronen Shaltiel , Amnon Ta-Shma
Venue:PROCEEDINGS OF THE 20TH ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, (CCC)
Citations:16 - 5 self