If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma. If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. Computational Complexity, 16(4):412-441, 2007. [doi]

Abstract

Abstract is missing.