On Sets Bounded Truth-Table Reducible to P-Selective Sets

We show that if every NP set in polynomial-time bounded truth-table reducible to some P-selective set, then NP is contained in DTIME (2 nO(1/ √ logn) . In the proof, we implement a recursive procedure that reduces the number of nondeterministic steps of a given nondeterministic computation.

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

[2]  Alan L. Selman,et al.  Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity , 1982, Inf. Control..

[3]  Vikraman Arvind,et al.  Polynomial time truth-table reductions to p-selective sets , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[4]  Uwe Schöning.  The power of counting , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[5]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[6]  Alan L. Selman,et al.  Reductions on NP and P-Selective Sets , 1982, Theor. Comput. Sci..

[7]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..

[8]  Jacobo Torán,et al.  Computing functions with parallel queries to NP , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[9]  Ker-I Ko.  On Self-Reducibility and Weak P-Selectivity , 1983, J. Comput. Syst. Sci..

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

[11]  Osamu Watanabe,et al.  How hard are sparse sets? , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[12]  Lane A. Hemaspaandra,et al.  Reductions to Sets of Low Information Content , 1992, Complexity Theory: Current Research.

[13]  Eric Allender,et al.  The Complexity of Sparse Sets in P , 1986, SCT.

[14]  C. Jockusch.  Semirecursive sets and positive reducibility , 1968 .

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

[16]  Mitsunori Ogihara.  Polynomial-time membership comparable sets , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[17]  Leslie G. Valiant,et al.  Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..

[18]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[19]  Sanjeev Saluja.  Relativized limitations of left set technique and closure classes of sparse sets , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

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

[21]  Frank Stephan,et al.  Approximable Sets , 1995, Inf. Comput..