论文信息 - Selectivity and Self-reducibility: New Characterizations of Complexity Classes

Selectivity and Self-reducibility: New Characterizations of Complexity Classes

It is known that a set is in P ii it is p-time Turing self-reducible and p-selective 2] and a p-time Turing self-reducible set is in NP \ coNP ii it is NP-selective 4]. We generalize these new characterizations to arbitrary time complexity classes. A simple and direct proof for the result of 2] is obtained. Probabilistic selectivity is also studied.

Jie Wang | Jie Wang

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

[2] Janos Simon. On some central problems in computational complexity , 1975 .

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

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

[5] Timothy J. Long. Strong Nondeterministic Polynomial-Time Reducibilities , 1982, Theor. Comput. Sci..

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

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

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

[9] Daniel A. Spielman,et al. PP is closed under intersection , 1991, STOC '91.

[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] Lane A. Hemaspaandra,et al. Selectivity: Reductions, Nondeterminism, and Function Classes , 1993 .

[12] Lance Fortnow,et al. PP is Closed Under Truth-Table Reductions , 1996, Inf. Comput..