论文信息 - On the complement of one complexity class in another

On the complement of one complexity class in another

We investigate the diagonalization theorems in [7] (Theorem 23), [3] (Theorem 6) and [10] (main Theorem) and show that they can be strengthened so as to be applicable to most complexity classes, not just to those closed under polynomial-time reducibility. Thus the applications in [7], [3] and [10] (e.g. P ≠ P ⇒ NP\P is not recursively presentable) are not peculiar to P, NP, PSPACE etc.; rather, they are examples of properties common to almost all "reasonable" complexity classes.

Diana Schmidt

[1] Uwe Schöning. On the Dtructure of Deltap2 , 1983, Inf. Process. Lett..

[2] Theodore P. Baker,et al. A second step toward the polynomial hierarchy , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[3] Richard E. Ladner,et al. On the Structure of Polynomial Time Reducibility , 1975, JACM.

[4] PAUL CHEW,et al. A Note on Structure and Looking Back Applied to the Complexity of Computable Functions , 1981, J. Comput. Syst. Sci..

[5] Uwe Schöning. A Uniform Approach to Obtain Diagonal Sets in Complexity Classes , 1982, Theor. Comput. Sci..

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

[7] Celia Wrathall,et al. Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[8] Kenneth W. Regan. On Diagonalization Methods and the Structure of Language Classes , 1983, FCT.

[9] José L. Balcázar,et al. A Note on a Theorem by Ladner , 1982, Inf. Process. Lett..

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

[11] Jeffrey D. Ullman,et al. Some Results on Tape-Bounded Turing Machines , 1969, JACM.

[12] Richard J. Lipton,et al. On the Structure of Sets in NP and Other Complexity Classes , 1981, Theor. Comput. Sci..