Abstract.
We prove that if NP \({\nsubseteq}\) BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable distribution that is hard for it. That is, the algorithm often errs on inputs from this distribution. This is the first worst-case to average-case reduction for NP of any kind. We stress however, that this does not mean that there exists one fixed samplable distribution that is hard for all probabilistic polynomial-time algorithms, which is a pre-requisite assumption needed for one-way functions and cryptography (even if not a sufficient assumption). Nevertheless, we do show that there is a fixed distribution on instances of NP-complete languages, that is samplable in quasi-polynomial time and is hard for all probabilistic polynomial-time algorithms (unless NP is easy in the worst case).
Our results are based on the following lemma that may be of independent interest: Given the description of an efficient (probabilistic) algorithm that fails to solve SAT in the worst case, we can efficiently generate at most three Boolean formulae (of increasing lengths) such that the algorithm errs on at least one of them.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Manuscript received 12 July 2006
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Gutfreund, D., Shaltiel, R. & Ta-Shma, A. If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. comput. complex. 16, 412–441 (2007). https://doi.org/10.1007/s00037-007-0235-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00037-007-0235-8
Keywords.
- Average-case complexity
- worst-case to average-case reductions
- foundations of cryptography
- pseudo classes