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

  • Authors:

  • Dan Gutfreund;Ronen Shaltiel;Amnon Ta-Shma

  • Affiliations:

  • School of Engineering and Applied Sciences, Harvard University, Cambridge, USA 02138;Department of Computer Science, University of Haifa, Haifa, Israel 31905;Department of Computer Science, Tel-Aviv University, Tel-Aviv, Israel 69978

  • Venue:
  • Computational Complexity
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.