Properties of NP-complete sets

We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S /spl nsupe/ L is a p-selective sparse set, then L -S is /spl les//sub m//sup p/-hard for NP. We demonstrate existence of a sparse set S /spl isin/ DTIME(2/sup 2n/) such that for every L /spl isin/ NP - P, L - S is not /spl les//sub m//sup p/-hard for NP. Moreover, we prove for every L /spl isin/ NP - P, that there exists a sparse S /spl isin/ EXP such that L - S is not /spl les//sub m//sup p/-hard for NP. Hence, removing sparse information in P from a complete set leaves the set complete, while removing sparse information in EXP from a complete set may destroy its completeness. Previously, these properties were known only for exponential time complexity classes. We use hypotheses about pseudorandom generators and secure one-way permutations to derive consequences for long-standing open questions about whether NP-complete sets are immune. For example, assuming that pseudorandom generators and secure one-way permutations exist, it follows easily that NP-complete sets are not p-immune. Assuming only that secure one-way permutations exist, we prove that no NP-complete set is DTIME(2/sup ne/)-immune. Also, using these hypotheses we show that no NP-complete set is quasipolynomial-close to P. We introduce a strong but reasonable hypothesis and infer from it that disjoint Turing-complete sets for NP are not closed under union. Our hypothesis asserts existence of a UP-machine M that accepts 0* such that for some 0 < /spl epsi/ < 1, no 2/sup ne/ time-bounded machine can correctly compute infinitely many accepting computations of M, We show that if UP /spl cap/ coUP contains DTIME(2/sup ne/)-bi-immune sets, then this hypothesis is true.

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

[2]  Uwe Schöning,et al.  Complete sets and closeness to complexity classes , 1986, Mathematical systems theory.

[3]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[4]  Alan L. Selman Natural Self-Reducible Sets , 1988, SIAM J. Comput..

[5]  Alan L. Selman,et al.  P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP , 1979, ICALP.

[6]  Luc Longpré,et al.  On Reductions of NP Sets to Sparse Sets , 1994, J. Comput. Syst. Sci..

[7]  Oded Goldreich,et al.  Foundations of Cryptography: List of Figures , 2001 .

[8]  Seinosuke Toda On polynomial-time truth-table reducibility of intractable sets to P-selective sets , 2005, Mathematical systems theory.

[9]  Harry Buhrman,et al.  Splittings, Robustness, and Structure of Complete Sets , 1998, SIAM J. Comput..

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

[11]  Lance Fortnow,et al.  Inverting onto functions , 2003, Inf. Comput..

[12]  Alan L. Selman,et al.  Reductions between disjoint NP-pairs , 2004 .

[13]  Lance Fortnow,et al.  Inverting onto functions , 1995, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[14]  Alexander A. Razborov,et al.  On provably disjoint NP-pairs , 1994, Electron. Colloquium Comput. Complex..

[15]  Joseph R. Shoenfield Degrees of Classes of RE Sets , 1976, J. Symb. Log..

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

[17]  Stephen R. Mahaney Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..

[18]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[19]  Jörg Rothe,et al.  Easy sets and hard certificate schemes , 1995, Acta Informatica.

[20]  Joan Feigenbaum,et al.  Languages that are easier than their proofs , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[21]  Ker-I Ko,et al.  Some Observations on the Probabilistic Algorithms and NP-hard Problems , 1982, Inf. Process. Lett..

[22]  Christian Glaßer,et al.  Disjoint NP-pairs , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[23]  Leonard Berman,et al.  On the structure of complete sets: Almost everywhere complexity and infinitely often speedup , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

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

[25]  Alan L. Selman,et al.  Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..

[26]  Paul Young,et al.  Reductions Among Polynomial Isomorphism Types , 1985, Theor. Comput. Sci..

[27]  Bin Fu On lower bounds of the closeness between complexity classes , 2005, Mathematical systems theory.

[28]  Bin Fu,et al.  Exponential-Time and Subexponential-Time Sets , 1993, Theor. Comput. Sci..

[29]  Osamu Watanabe,et al.  On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets , 1991, SIAM J. Comput..

[30]  Steven Homer,et al.  Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography , 1992, J. Comput. Syst. Sci..

[31]  Harry Buhrman,et al.  Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy , 1992, FSTTCS.

[32]  Edith Hemaspaandra,et al.  P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility , 1996, J. Comput. Syst. Sci..

[33]  Oded Goldreich Foundations of Cryptography: Index , 2001 .

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

[35]  Lance Fortnow,et al.  Distributionally Hard Languages , 2001, Theory of Computing Systems.

[36]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[37]  Yaacov Yesha,et al.  On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets , 1983, SIAM J. Comput..

[38]  Jie Wang,et al.  Immunity of Complete Problems , 1994, Inf. Comput..