Skip to main content
SpringerLink
Log in

With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy

  • Conference paper
  • First Online:
Structure in Complexity Theory

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

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

Author information

Authors and Affiliations

  1. Computer Science Department, Cornell University, 14853, Ithaca, NY

    Jin-yi Cai

Authors
  1. Jin-yi Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alan L. Selman

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cai, Jy. (1986). With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy. In: Selman, A.L. (eds) Structure in Complexity Theory. Lecture Notes in Computer Science, vol 223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16486-3_92

Download citation

  • DOI: https://doi.org/10.1007/3-540-16486-3_92

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16486-9

  • Online ISBN: 978-3-540-39825-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation