Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers

We give two nondeterministic reductions which yield new direct product theorems (DPTs) for Boolean circuits. In these theorems one assumes that a target function F is mildly hard against nondeterministic circuits, and concludes that the direct product Ft is extremely hard against (only polynomially smaller) probabilistic circuits. The main advantage of these results compared with previous DPTs is the strength of the size bound in our conclusion. As an application, we show that if NP is not in coNP/poly then, for every PPT algorithm attempting to produce satisfying assigments to Boolean formulas, there are infinitely many instances where the algorithm's success probability is nearly-exponentially small. This furthers a project of Paturi and Pudlák [STOC'10].

[1]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[2]  Luca Trevisan,et al.  Extracting randomness from samplable distributions , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[3]  Oded Goldreich,et al.  Foundations of Cryptography: Volume 1, Basic Tools , 2001 .

[4]  Chee-Keng Yap,et al.  Some Consequences of Non-Uniform Conditions on Uniform Classes , 1983, Theor. Comput. Sci..

[5]  Andrew Drucker.  New Limits to Classical and Quantum Instance Compression , 2015, SIAM J. Comput..

[6]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[7]  Carsten Lund,et al.  On the hardness of computing the permanent of random matrices , 1996, STOC '92.

[8]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[9]  Noam Nisan,et al.  Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[10]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[11]  Alexander Healy,et al.  Randomness-E-cient Sampling within NC 1 , 2007 .

[12]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[13]  Alan L. Selman,et al.  Qualitative Relativizations of Complexity Classes , 1985, J. Comput. Syst. Sci..

[14]  Michael E. Saks,et al.  Products and Help Bits in Decision Trees , 1999, SIAM J. Comput..

[15]  Avi Wigderson,et al.  P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.

[16]  Richard Chang,et al.  Bounded Queries and the NP Machine Hypothesis , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[17]  Alexander Healy.  Randomness-Efficient Sampling Within NC1 , 2006, APPROX-RANDOM.

[18]  Pavel Pudlák,et al.  On the complexity of circuit satisfiability , 2010, STOC '10.

[19]  Amihood Amir,et al.  Some connections between bounded query classes and nonuniform complexity , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[20]  Avi Wigderson,et al.  Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications , 2008, Theory Comput..

[21]  Mark D. Reid,et al.  Generalised Pinsker Inequalities , 2009, COLT.

[22]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[23]  Ryan O'Donnell,et al.  Hardness amplification within NP , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[24]  I. Althöfer.  On sparse approximations to randomized strategies and convex combinations , 1994 .

[25]  Oded Goldreich.  Foundations of Cryptography: Volume 1 , 2006 .

[26]  Emanuele Viola,et al.  Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols , 2008, Theory Comput..

[27]  Lane A. Hemaspaandra,et al.  The Complexity Theory Companion , 2002, Texts in Theoretical Computer Science An EATCS Series.

[28]  Leonid A. Levin,et al.  One-way functions and pseudorandom generators , 1985, STOC '85.

[29]  Amihood Amir,et al.  Some connections between bounded query classes and non-uniform complexity , 2000, Inf. Comput..

[30]  Ronen Shaltiel.  Towards proving strong direct product theorems , 2003, computational complexity.

[31]  Alexander Healy,et al.  Randomness-Efficient Sampling within NC1 , 2006, computational complexity.

[32]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[33]  Avi Wigderson,et al.  Uniform direct product theorems: simplified, optimized, and derandomized , 2008, SIAM J. Comput..

[34]  János Komlós,et al.  Deterministic simulation in LOGSPACE , 1987, STOC.

[35]  Samuel R. Buss,et al.  On truth-table reducibility to SAT and the difference hierarchy over NP , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[36]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[37]  Andrew Chi-Chih Yao,et al.  Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.

[38]  Richard J. Lipton,et al.  Simple strategies for large zero-sum games with applications to complexity theory , 1994, STOC '94.

[39]  Emanuele Viola,et al.  Hardness amplification proofs require majority , 2008, SIAM J. Comput..

[40]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[41]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[42]  Luca Trevisan.  Average-case Complexity , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[43]  Peter Harremoës,et al.  Refinements of Pinsker's inequality , 2003, IEEE Trans. Inf. Theory.

[44]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[45]  Timothy J. Long,et al.  Quantitative Relativizations of Complexity Classes , 1984, SIAM J. Comput..

[46]  Noam Nisan,et al.  On Yao's XOR-Lemma , 1995, Electron. Colloquium Comput. Complex..

[47]  Avi Wigderson,et al.  A randomness-efficient sampler for matrix-valued functions and applications , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[48]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[49]  Andrew Drucker,et al.  A PCP Characterization of AM , 2010, ICALP.