Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Combined simplicity and immunity in relativized NP

Extended abstract

  • Conference paper
  • First Online:
STACS 85 (STACS 1985)

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

Included in the following conference series:

Abstract

In this paper an oracle A is presented which has the property thaT NP(A) has a single set which is both NP(A) simple and P(A) immune.

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., J. Gill & R. Solovay — Relativizations of the P=NP question SIAM J. Comp. 4 (75) pp431–442

    Google Scholar 

  2. Balcazar J. — Simplicity for relativized complexity classes. Report de Recerca RR83/02 Facult. d'Informatica U. Barcelona (To appear in SIAM J. Comp.)

    Google Scholar 

  3. Bennet C. & J. Gill — Relative to a random oracle PA ≠ NPA with probability 1 SIAM J. Comp. 10 (81) pp96–113

    Google Scholar 

  4. Homer S. & I. Gasarch — Relativizations Comparing NP and Exponential Time Inf. & Control 58 (84)

    Google Scholar 

  5. Homer S. & W. Maass — Oracle dependent properties of the lattice of NP sets Theoretical Comp. Sc. 24 (83) pp279–289

    Google Scholar 

  6. Kozen D. — Indexing of subrecursive languages Theoretical Comp. Sc. 11 (80) pp277–301

    Google Scholar 

  7. Regan K. — On diagonalisation methods & the structure of language classes — Lecture Notes in Computer Science 158 Proceedings of the 1983 int. FCT conference pp363–380

    Google Scholar 

  8. Schoening U. — Relativization and infinite subsets of NP sets. Unpublished manuscript (82)

    Google Scholar 

  9. Schoening U. & R.V. Book — Immunity, Relativizations and Nondeterminism SIAM J. Comp. 13 no.2 (84) pp329–337

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Depts of Math. & Comp. Sci., University of Amsterdam, Roetersstraat 15, 1018 WB, Amsterdam

    Leen Torenvliet & Peter van Emde Boas

Authors
  1. Leen Torenvliet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter van Emde Boas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Torenvliet, L., van Emde Boas, P. (1984). Combined simplicity and immunity in relativized NP. In: Mehlhorn, K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024022

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13912-6

  • Online ISBN: 978-3-540-39136-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation