Skip to main content
SpringerLink
Log in

Controlled relativizations of P and NP

Abstract

  • Contributed Papers
  • Conference paper
  • First Online:
Theoretical Computer Science

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

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. Baker, T., Gill, J. and Solovay, R., Relativizations of the P =? NP question. SIAM J. Computing, 4(1975), 431–442.

    Google Scholar 

  2. Bennett, C. and Gill, J., Relative to a random oracle A, PA ≠ NPA ≠ CO-NPA with probability 1. SIAM J. Computing, 10(1981), 96–113.

    Google Scholar 

  3. Book, R., Bounded query machines: on NP and PSPACE. Theoret. Comput. Sci., 15(1981), 27–39.

    Google Scholar 

  4. Book, R., Long, T. and Selman, A., Qualitative relativizations of complexity classes, in preparation.

    Google Scholar 

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

    Google Scholar 

  6. Book, R., Wilson, C. and Xu Mei-rui, Relativizing time, space, and time-space. SIAM J. Computing, 11(1982), 571–581.

    Google Scholar 

  7. Book, R. and Wrathall, C., Bounded query machines: on NP( ) and NPQUERY( ). Theoret. Comput. Sci., 15(1981), 41–50.

    Google Scholar 

  8. Breidbart, S., Splitting recursive sets. J. Comput. Syst. Sci., 17(1978), 56–64.

    Google Scholar 

  9. Homer, S. and Maass, W., Oracle dependent properties of the lattice of NP sets. Theoret. Comput. Sci., to appear.

    Google Scholar 

  10. Ladner, R., Lynch, N. and Selman, A., A comparison of polynomial-time reducibilities. Theoret. Comput. Sci., 1(1975), 103–123.

    Google Scholar 

  11. Long, T., Relativizing nondeterministic time, unpublished manuscript, 1981.

    Google Scholar 

  12. Long, T., Strong nondeterministic polynomial-time reducibilities. Theoret. Comput. Sci., 21(1982), 1–25.

    Google Scholar 

  13. Schöning, U., Relativization and infinite subsets of NP sets, unpublished manuscript, 1982.

    Google Scholar 

  14. Selman, A., Xu Mei-rui and Book, R., Positive relativizations of complexity classes. SIAM J. Computing, 12(1983), to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California at Santa Barbara, 93106, Santa Barbara, California, U.S.A.

    Ronald V. Book

  2. Department of Computer Science, New Mexico State University, 88003, Las Cruces, New Mexico, U.S.A.

    Timothy J. Long

  3. Department of Computer Science, Iowa State University, 50010, Ames, Iowa, U.S.A.

    Alan L. Selman

Authors
  1. Ronald V. Book
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Timothy J. Long
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alan L. Selman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Armin B. Cremers Hans-Peter Kriegel

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Book, R.V., Long, T.J., Selman, A.L. (1982). Controlled relativizations of P and NP. In: Cremers, A.B., Kriegel, HP. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036471

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39421-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation