Polynomial-time membership comparable sets

The paper introduces and studies a notion called polynomial-time membership comparable sets, which is a generalization of P-selective sets. For a function g, a set A is called polynomial-time g-membership comparable if there is a polynomial-time computable function f such that for any x/sub 1/,...,x/sub m/ with m/spl ges/g(max{|x/sub 1/|,...,|x/sub m/|}), outputs b/spl isin/{0,1}/sup m/ such that (A(x/sub 1/),...A(x/sub m/))/spl ne/b. It is shown for each C chosen from {PSPACE, UP, FewP, NP, C=P, PP, MOD/sub 2/P, MOD/sub 3/P,...}, that if all of C are polynomial-time c(log n)-membership comparable for some fixed constant c<1, then C=P. As a corollary, it is shown that if there is same constant c<1 such that all of C are polynomial-time n/sup c/-truth-table reducible to some P-selective sets, then C=P, which resolves a question that has been left open for a long time.<<ETX>>

[1]  Eric Allender,et al.  Lower bounds for the low hierarchy , 1992, JACM.

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

[3]  Luc Longpré,et al.  Hard Promise Problems and Nonuniform Complexity , 1993, Theor. Comput. Sci..

[4]  Amihood Amir,et al.  Polynomial Terse Sets , 1988, Inf. Comput..

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

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

[7]  John Gill,et al.  Terse, Superterse, and Verbose Sets , 1993, Inf. Comput..

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

[9]  Frank Stephan,et al.  Approximable sets , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[10]  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.

[11]  Mark W. Krentel.  The Complexity of Optimization Problems , 1988, J. Comput. Syst. Sci..

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

[13]  R. Beigel,et al.  Bounded Queries to SAT and the Boolean Hierarchy , 1991, Theor. Comput. Sci..

[14]  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.

[15]  Jin-Yi Cai,et al.  On the Power of Parity Polynomial Time , 1989, STACS.

[16]  Uwe Schöning,et al.  Complexity and Structure , 1986, Lecture Notes in Computer Science.

[17]  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.

[18]  Mitsunori Ogihara,et al.  On Sparse Hard Sets for Counting Classes , 1993, Theor. Comput. Sci..

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

[20]  Ulrich Hertrampf,et al.  Relations Among Mod-Classes , 1990, Theor. Comput. Sci..

[21]  U. Hertrampt.  Relations among MOD-classes , 1990 .

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