International Symposium on Mathematical Foundations of Computer Science

MFCS 1984: Mathematical Foundations of Computer Science 1984 pp 1-16 | Cite as

Separating, strongly separating, and collapsing relativized complexity classes

• Authors
• Authors and affiliations

• José Luis Balcázar

Invited Lectures

First Online: 21 June 2005

• 93 Downloads

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

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

Preview

Unable to display preview. Download preview PDF.

References

1. [A]
   D. Angluin: On counting problems and the polynomial-time hierarchy, Theor. Comp. Sci. 12 (80) 161–173.Google Scholar
2. [BGS]
   T. Baker, J. Gill, R. Solovay: Relativizations of the P =? NP question, SIAM J. Comp. 4 (75), 431–442.Google Scholar
3. [BS]
   T. Baker. A. Selman: A second step toward the polynomial hierarchy, Theor. Comp. Sci. 8 (80) 177–187.Google Scholar
4. [Bal]
   J. L. Balcázar: Simplicity, relativizations, and nondeterminism, SIAM J. Comp. (84), to appear.Google Scholar
5. [BBLSS]
   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. [BBS]
   J. Balcázar, R. Book, U. Schöning: Sparse oracles, lowness, and highness, this conference.Google Scholar
7. [BR]
   J. Balcázar, D. Russo: Immunity and simplicity in relativizations of probabilistic complexity classes, submitted for publication.Google Scholar
8. [B]
   R. Book: Bounded query machines: on NP and PSPACE, Theor. Comp. Sci. 15 (81), 27–39.Google Scholar
9. [BLS]
   R. Book, T. Long, A. Selman: Quantitative relativizations of complexity classes, submitted for publication.Google Scholar
10. [BW]
    R. Book, C. Wrathall: Bounded query machines: on NP() and NPQUERY(), Theor. Comp. Sci. 15 (81), 41–50.Google Scholar
11. [G]
    J. Gill: Computational complexity of probabilistic Turing machines, SIAM J. Comp. 6 (77), 675–695.Google Scholar
12. [H]
    H. Heller: Relativized polynomial hierarchies extending two levels, Dr. R. Nat. dissertation, Inst. für Informatik, München (82).Google Scholar
13. [HM]
    S. Homer, W. Maass: Oracle dependent properties of the lattice of NP sets, Theor. Comp. Sci 24 (83), 279–289.Google Scholar
14. [K]
    C.M.R. Kintala: Computations with a restricted number of nondeterministic steps, Ph.D. dissertation, Penn. St. Univ. (77)Google Scholar
15. [KL]
    R. Karp, R. Lipton: Some connections between nonuniform and uniform complexity classes, 12th STOC-ACM (80), 302–309.Google Scholar
16. [Ku]
    S. Kurtz: On sparse sets in NP-P: relativizations, submitted for publication.Google Scholar
17. [L]
    T. Long: On restricting the size of oracles compared with restricting access to oracles, submitted for publication.Google Scholar
18. [R]
    C. Rackoff: Relativized questions involving probabilistic algorithms, J. ACM 29 (82), 261–268.Google Scholar
19. [Re]
    K. Regan: On diagonalization methods and the structure of language classes, FCT 83.Google Scholar
20. [SB]
    U. Schöning, R. Book: Immunity, relativizations, and nondeterminism, SIAM J. Comp. (84), to appear.Google Scholar
21. [XDB]
    Xu Mei-rui, J. Doner, R. Book: Refining nondeterminism in relativized complexity classes, J. ACM 30 (83), 677–685.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

• José Luis Balcázar
  • 1

1. 1.Facultad de Informática de BarcelonaBarcelona 34Spain