Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses

This paper presents the following results on sets that are complete for NP. (i)If there is a problem in NP that requires $2^{n^{\Omega(1)}}$ time at almost all lengths, then every many-one NP-complete set is complete under length-increasing reductions that are computed by polynomial-size circuits.(ii)If there is a problem in co-NP that cannot be solved by polynomial-size nondeterministic circuits, then every many-one NP-complete set is complete under length-increasing reductions that are computed by polynomial-size circuits.(iii)If there exist a one-way permutation that is secure against subexponential-size circuits and there is a hard tally language in NP∩co-NP, then there is a Turing complete language for NP that is not many-one complete. Our first two results use worst-case hardness hypotheses whereas earlier work that showed similar results relied on average-case or almost-everywhere hardness assumptions. The use of average-case and worst-case hypotheses in the last result is unique as previous results obtaining the same consequence relied on almost-everywhere hardness results.

[1]  Aduri Pavan,et al.  Bi-immunity separates strong NP-completeness notions , 2004, Inf. Comput..

[2]  Harry Buhrman,et al.  Completeness for nondeterministic complexity classes , 2005, Mathematical systems theory.

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

[4]  Joan Feigenbaum,et al.  On being incoherent without being very hard , 2005, computational complexity.

[5]  Jack H. Lutz,et al.  Measure, Stochasticity, and the Density of Hard Languages , 1993, STACS.

[6]  Nancy A. Lynch,et al.  Comparison of polynomial-time reducibilities , 1974, STOC '74.

[7]  G. H. C. New.  On coherence , 1989, Nature.

[8]  Osamu Watanabe,et al.  A Comparison of Polynomial Time Completeness Notions , 1987, Theor. Comput. Sci..

[9]  Luca Trevisan,et al.  Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[10]  Steven Homer,et al.  Complete Problems and Strong Polynomial Reducibilities , 1992, SIAM J. Comput..

[11]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[12]  M. E. R..  “If” , 1921, Definitions.

[13]  L. Berman.  Polynomial reducibilities and complete sets. , 1977 .

[14]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[15]  Selmer M. Johnson.  A new upper bound for error-correcting codes , 1962, IRE Trans. Inf. Theory.

[16]  Aduri Pavan,et al.  Separation of NP-Completeness Notions , 2001, SIAM J. Comput..

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

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

[19]  Juris Hartmanis,et al.  On isomorphisms and density of NP and other complete sets , 1976, STOC '76.

[20]  Russell Impagliazzo,et al.  Hard-core distributions for somewhat hard problems , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[21]  Osamu Watanabe,et al.  One-Way Functions and the Isomorphism Conjecture , 2009, Electron. Colloquium Comput. Complex..

[22]  Lance Fortnow,et al.  Infeasibility of instance compression and succinct PCPs for NP , 2007, J. Comput. Syst. Sci..

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

[24]  Leonid A. Levin,et al.  On Constructing 1-1 One-Way Functions , 1995, Electron. Colloquium Comput. Complex..

[25]  Juris Hartmanis,et al.  On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[26]  Lars-Ake Levin,et al.  Problems of Information Transmission , 1973 .

[27]  Joan Feigenbaum,et al.  On coherence, random-self-reducibility, and self-correction , 1998, computational complexity.

[28]  Harry Buhrman,et al.  NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[29]  N. V. Vinodchandran,et al.  Partial Bi-immunity, Scaled Dimension, and NP-Completeness , 2007, Theory of Computing Systems.

[30]  Lane A. Hemaspaandra.  SIGACT news complexity theory column 40 , 2003, SIGA.

[31]  Noam Nisan,et al.  Hardness vs Randomness , 1994, J. Comput. Syst. Sci..

[32]  Jack H. Lutz,et al.  Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small , 1996, Theor. Comput. Sci..

[33]  John M. Hitchcock,et al.  Comparing reductions to NP-complete sets , 2006, Inf. Comput..

[34]  Carlos Gershenson,et al.  Information and Computation , 2013, Handbook of Human Computation.

[35]  Mitsunori Ogihara,et al.  P-selective sets, and reducing search to decision vs. self-reducibility , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[36]  Joan Feigenbaum,et al.  On coherence, random-self-reducibility, and self-correction , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

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

[38]  Noam Nisan,et al.  BPP has subexponential time simulations unless EXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[39]  Lance Fortnow,et al.  Six hypotheses in search of a theorem , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[40]  Manindra Agrawal,et al.  Pseudo-random generators and structure of complete degrees , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[41]  Osamu Watanabe,et al.  One-Way Functions and the Berman-Hartmanis Conjecture , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[42]  R. Beigel.  Query-limited reducibilities , 1988 .

[43]  Klaus Ambos-Spies,et al.  Separating NP-completeness notions under strong hypotheses , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[44]  Harry Buhrman,et al.  Non-Uniform Reductions , 2008, Theory of Computing Systems.

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

[46]  Joan Feigenbaum,et al.  The power of adaptiveness and additional queries in random-self-reductions , 2005, computational complexity.