Polynomial time truth-table reductions to p-selective sets

We make an elaborate analysis of the intervals defined by the ordered list of queries to the p-selective set. It turns out that the properties we derive are strong enough to get a collapse to P for several complexity classes, assuming that they are quasi-linear truth-table reducible (or in some cases o(logn)-tt reducible) to a p-selective set. More specifically, for any class /spl Kscrspl isin/{NP, PP, C=P, /spl oplus/P) we show that if /spl Kscr/ is quasi-linear truth-table reducible to a p-selective set then /spl Kscr/=P. For other Mod/sub k/P classes (k>2) we show that if Mod/sub k/P is o(log n)-truth-table reducible to a p-selective set then Mod/sub k/P=P.<<ETX>>

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

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

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

[4]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

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

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

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

[8]  J. Köbler,et al.  The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

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

[10]  Alan L. Selman.  Some Observations on NP, Real Numbers and P-Selective Sets , 1981, J. Comput. Syst. Sci..

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

[12]  José L. Balcázar.  Self-Reducibility , 1990, J. Comput. Syst. Sci..

[13]  Stephen R. Mahaney.  Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[14]  Harry Buhrman,et al.  P-selective self-reducibles sets: a new characterization of P , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

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

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

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

[18]  Mitsunori Ogihara,et al.  On one query, self-reducible sets , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

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

[20]  R. Beigel.  NP-hard Sets are P-Superterse Unless R = NP , 1988 .