Abstract
In [4] a new relativization notion — stringent relativization — has been introduced for investigating a fine relationship between complexity classes. But considering “stringent relativization” is meaningful even for more general relationships such as P vs. NP. In this talk we explain the motivation of this relativization notion, examine some basic facts, and discuss known results and related open problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, T., Gill, J., Solovay, R.: Relativizatons of the P =? NP question. SIAM J. Comput. 4(4), 431–442 (1975)
Balcázar, J., Díaz, J., Gabarró, J.: Structural Complexity I & II. Springer, Heidelberg (1989 and 1990)
Book, R., Long, T., Selman, A.: Quantitative relativization of complexity classes. SIAM J. Comput. 13, 461–487 (1984)
Cai, J.-Y., Watanabe, O.: On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 202–211. Springer, Heidelberg (2003)
Cai, J.-Y., Watanabe, O.: Relativized collapsing between BPP and PH under stringent oracle access (submitted)
Cai, J.-Y.: With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy. In: Proc. 18th ACM Sympos. on Theory of Comput., pp. 21–29 (1986); The final version appeared in J. Comp. Syst. Sci., 38(1), 68–85 (1989)
Du, D., Ko, K.: Theory of Computational Complexity. John Wiley & Sons, Inc., Chichester (2000)
Furst, M., Saxe, J., Sipser, M.: Parity, circuits, and the polynomial time hierarchy. In: Proc. 22nd IEEE Symposium on Foundations of Computer Science (FOCS 1981), pp. 260–270. IEEE, Los Alamitos (1981)
Håstad, J.: Almost optimal lower bounds for small depth circuits. In: Proc. 18th ACM Symposium on Theory of Computing (STOC 1986), pp. 6–20. ACM, New York (1986)
Karp, R., Lipton, R.: Some connections between nonuniform and uniform complexity classes. In: Proc. 12th ACM Symposium on Theory of Computing (STOC 1980), pp. 302–309. ACM, New York (1980); An extended version appeared as: Turing machines that take advice. In: L’Enseignement Mathématique (2nd series) 28, pp. 191–209 (1982)
Wilson, C.B.: Relativized circuit complexity. In: Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS 1983), pp. 329–334. IEEE, Los Alamitos (1983)
Yao, A.C.: Separating the polynomial-time hierarchy by oracles. In: Proc. 26th IEEE Symposium on Foundations of Computer Science (FOCS 1985), pp. 1–10. IEEE, Los Alamitos (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, JY., Watanabe, O. (2003). Stringent Relativization. In: Pandya, P.K., Radhakrishnan, J. (eds) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2003. Lecture Notes in Computer Science, vol 2914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24597-1_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-24597-1_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20680-4
Online ISBN: 978-3-540-24597-1
eBook Packages: Springer Book Archive