Skip to main content
SpringerLink
Log in

Separating, strongly separating, and collapsing relativized complexity classes

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 176))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Angluin: On counting problems and the polynomial-time hierarchy, Theor. Comp. Sci. 12 (80) 161–173.

    Google Scholar 

  2. T. Baker, J. Gill, R. Solovay: Relativizations of the P =? NP question, SIAM J. Comp. 4 (75), 431–442.

    Google Scholar 

  3. T. Baker. A. Selman: A second step toward the polynomial hierarchy, Theor. Comp. Sci. 8 (80) 177–187.

    Google Scholar 

  4. J. L. Balcázar: Simplicity, relativizations, and nondeterminism, SIAM J. Comp. (84), to appear.

    Google Scholar 

  5. J. Balcázar, R. Book, T. Long, U. Schöning, A. Selman: Sparse oracles may as well be empty, unpublished manuscript (83).

    Google Scholar 

  6. J. Balcázar, R. Book, U. Schöning: Sparse oracles, lowness, and highness, this conference.

    Google Scholar 

  7. J. Balcázar, D. Russo: Immunity and simplicity in relativizations of probabilistic complexity classes, submitted for publication.

    Google Scholar 

  8. R. Book: Bounded query machines: on NP and PSPACE, Theor. Comp. Sci. 15 (81), 27–39.

    Google Scholar 

  9. R. Book, T. Long, A. Selman: Quantitative relativizations of complexity classes, submitted for publication.

    Google Scholar 

  10. R. Book, C. Wrathall: Bounded query machines: on NP() and NPQUERY(), Theor. Comp. Sci. 15 (81), 41–50.

    Google Scholar 

  11. J. Gill: Computational complexity of probabilistic Turing machines, SIAM J. Comp. 6 (77), 675–695.

    Google Scholar 

  12. H. Heller: Relativized polynomial hierarchies extending two levels, Dr. R. Nat. dissertation, Inst. für Informatik, München (82).

    Google Scholar 

  13. S. Homer, W. Maass: Oracle dependent properties of the lattice of NP sets, Theor. Comp. Sci 24 (83), 279–289.

    Google Scholar 

  14. C.M.R. Kintala: Computations with a restricted number of nondeterministic steps, Ph.D. dissertation, Penn. St. Univ. (77)

    Google Scholar 

  15. R. Karp, R. Lipton: Some connections between nonuniform and uniform complexity classes, 12th STOC-ACM (80), 302–309.

    Google Scholar 

  16. S. Kurtz: On sparse sets in NP-P: relativizations, submitted for publication.

    Google Scholar 

  17. T. Long: On restricting the size of oracles compared with restricting access to oracles, submitted for publication.

    Google Scholar 

  18. C. Rackoff: Relativized questions involving probabilistic algorithms, J. ACM 29 (82), 261–268.

    Google Scholar 

  19. K. Regan: On diagonalization methods and the structure of language classes, FCT 83.

    Google Scholar 

  20. U. Schöning, R. Book: Immunity, relativizations, and nondeterminism, SIAM J. Comp. (84), to appear.

    Google Scholar 

  21. Xu Mei-rui, J. Doner, R. Book: Refining nondeterminism in relativized complexity classes, J. ACM 30 (83), 677–685.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facultad de Informática de Barcelona, Jordi Girona Salgado 31, Barcelona 34, Spain

    José Luis Balcázar

Authors
  1. José Luis Balcázar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Balcázar, J.L. (1984). Separating, strongly separating, and collapsing relativized complexity classes. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030286

Download citation

  • DOI: https://doi.org/10.1007/BFb0030286

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation