Abstract
It is known that for almost every oracle set A, P(A) ≠ NP(A) and PH(A) ≠ PSPACE(A); but there are no known results that relate these facts to the P =?NP or PH =?PSPACE problems. Here the following result is shown (Theorem 6):
If for almost every oracle set A, the polynomial-time hierarchy relative to A collapses (to some finite level), then the unrelativized polynomial-time hierarchy collapses.
Also, a new characterization (Theorem 2) of classes of the form ALMOST-R = {A ¦ for almost every B, A ∃ R(B)}, where 72. is any appropriate reducibility, is established. This new characterization, The Random Oracle Characterization, is based on algorithmically random oracle sets, and shows that for any appropriate reducibility R, ALMOST-R is precisely the recursive part of R(B) for every algorithmically random language B. The paper itself is part of a development of the properties of classes of the form ALMOST-R, extending the results of Book, Lutz, and Wagner [4].
This work was supported in part by the National Science Foundation under Grants CCR-8913584 and CCR-9302057.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Ambos-Spies. Randomness, relativizations, and polynomial reducibilities, Proc. 1st Conf. Structure in Complexity Theory, Lecture Notes in Computer Sci. 223, Springer-Verlag, 1986, 23–34.
J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity II, Springer-Verlag, 1990.
C. Bennett and J. Gill. Relative to a random oracle, P A ≠ NP A ≠ co-NP A with probability 1, SIAM J. Computing 10 (1981), 96–113.
R. Book, J. Lutz, and K. Wagner. An observation on probability versus randomness with applications to complexity classes, Math. Systems Theory 26 (1994), to appear. See also Proc. STACS 92, Lecture Notes in Computer Sci. 577, Springer-Verlag, 319–328.
S. Kautz. Degrees of Random Sets, Ph.D. Dissertation, Cornell University, 1991.
M. Li and P. Vitanyi. Kolmogorov complexity and its applications, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, vol. A, Elsevier Sci. Publishers (1990), 187–254.
J. Lutz. Almost everywhere high nonuniform complexity, J. Comput. System Sci. 44 (1992), 220–258.
J. Lutz, A pseudorandom oracle characterization of BPP, SIAM J. Computing, 24 (1993), to appear. See also Proc. Sixth IEEE Conf. on Structure in Complexity Theory, 1991, 190–195.
P. Martin-Löf. On the definition of random sequences, Info. and Control 9 (1966), 602–619.
P. Martin-Löf. Complexity oscillations in infinite binary sequences, Zeitschrift für Wahrscheinlichkeitstheory und Verwandte Gebiete 19 (1971), 225–230.
N. Nisan and A. Wigderson. Hardness vs. randomness, Proc. 29th IEEE Symp. Found. of Comput. Sci. (1988), 2–11.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Book, R.V. (1993). Relativizing complexity classes with Random Oracles. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_255
Download citation
DOI: https://doi.org/10.1007/3-540-57568-5_255
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57568-9
Online ISBN: 978-3-540-48233-8
eBook Packages: Springer Book Archive