iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/BFb0039591
Towards a theory of relativizations: Positive relativizations | SpringerLink
Skip to main content
Springer Nature Link
Log in

Towards a theory of relativizations: Positive relativizations

  • Invited Presentations
  • Conference paper
  • First Online:
STACS 87 (STACS 1987)

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

Included in the following conference series:

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

    Google Scholar 

  2. J. Balcázar and R. Book, Sets with small generalized Kolmogorov complexity, Acta Inform., to appear. Also see J. Balcázar and R. Book, On generalized Kolmogorov complexity, STACS-86, Lecture Notes in Computer Science 210 (1986), 334–440.

    Google Scholar 

  3. J. Balcázar, R. Book, and U. Schöning, On bounded query machines, Theoret. Comput. Sci. 40 (1985), 237–243.

    Google Scholar 

  4. J. Balcázar, R. Book, and U. Schöning, The polynomial-time hierarchy and sparse oracles, J. Assoc. Comput. Mach. 33 (1986), 603–617.

    Google Scholar 

  5. J. Balcázar, R. Book, and U. Schöning, Sparse sets, lowness, and highness, SIAM J. Computing 15 (1986), 739–747.

    Google Scholar 

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

    Google Scholar 

  7. R. Book, Relativizations of complexity classes, in (G. Wechsung, ed.), Frege Conference 1984 — Proc. of the International Conference, Akademie-Verlag, Berlin, 1984, 296–302.

    Google Scholar 

  8. R. Book, Separating relativized complexity classes, in (D. Kueker, E.G.K. Lopez-Escobar, and C. Smith, eds.), Mathematical Logic and Theoretical Computer Science. Lecture Notes in Pure and Applied Mathematics, Marcel Dekker, to appear.

    Google Scholar 

  9. R. Book, T. Long, and A. Selman, Quantitative relativizations of complexity classes, SIAM J. Comput. 13 (1984), 461–487.

    Google Scholar 

  10. R. Book, T. Long, and A. Selman, Qualitative relativizations of complexity classes, J. Comput. Syst. Sci. 30 (1985), 395–413.

    Google Scholar 

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

    Google Scholar 

  12. S. Cook, The complexity of theorem-proving procedures, Proc. 3rd ACM Symp. Theory of Computing, 1971, 151–158.

    Google Scholar 

  13. L. Hemachandra, The sky is falling: the strong exponential hierarchy collapses, Technical Report TR 86-77, Dept. of Computer Science, Cornell University, 1986.

    Google Scholar 

  14. R. Karp, Reducibility among combinatorial problems, in R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computation, Plenum Press, 1972, 85–104.

    Google Scholar 

  15. R. Karp and R. Lipton, Some connections between nonuniform and uniform complexity classes, Proc. 12 th ACM Symp. Theory of Computing, 1980, 302–309. An extended version has appeared as: Turing machines that take advice, L'Enseignement Mathématique, 2nd Series 28 (1982), 191–209.

    Google Scholar 

  16. R. Ladner and N. Lynch, Relativization of questions about log space computability, Math. Syst. Theory 10 (1976), 19–32.

    Google Scholar 

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

    Google Scholar 

  18. T. Long, On restricting the size of oracles compared with restricting access to oracles, SIAM J. Comput. 14 (1985), 585–597.

    Google Scholar 

  19. T. Long and A. Selman, Relativizing complexity classes with sparse oracles, J. Assoc. Comput. Mach. 33 (1986), 618–627.

    Google Scholar 

  20. D. Plaisted, Restricted oracles, Technical Report UIUCDCS-R-79-995, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, October 1979.

    Google Scholar 

  21. D. Plaisted, New NP-hard and NP-complete polynomial and integer divisibility problems, Theoret. Comput. Sci. 31 (1984), 125–138.

    Google Scholar 

  22. D. Plaisted, Complete divisibility problems for slowly untilized oracles, Theoret. Comput. Sci. 35 (1985), 245–260.

    Google Scholar 

  23. C. Rackoff and J. Seiferas, Limitations on separating nondeterministic complexity classes, SIAM J. Comput. 10 (1981), 742–745.

    Google Scholar 

  24. W. Ruzzo, J. Simon, and M. Tompa, Space-bounded hierarchies and probabilistic computation, J. Comput. Syst. Sci. 28 (1984), 216–230.

    Google Scholar 

  25. W. Savitch, Relationships between nondeterministic and deterministic space complexities, J. Comput. Syst. Sci. 4 (1970), 177–192.

    Google Scholar 

  26. A. Selman, M.-R. Xu, and R. Book, Positive relativizations of complexity classes, SIAM J. Comput. 12 (1983), 565–579.

    Google Scholar 

  27. I. Simon, On Some Subrecursive Reducibilities, Ph.D. dissertation, Stanford University, 1977.

    Google Scholar 

  28. L. Stockmeyer, The polynomial time hierarchy, Theoret. Comput. Sci. 3 (1976), 1–22.

    Google Scholar 

  29. C. Wilson, Relativized Circuit Size and Depth, Ph.D. dissertation, University of Toronto, 1985.

    Google Scholar 

  30. C. Wilson, A measure of relativized space which is faithful with respect to de submitted for publication.

    Google Scholar 

  31. C. Wilson, Relativized NC, submitted for publication.

    Google Scholar 

  32. C. Wrathall, Complete sets and the polynoial-time hierarchy, Theoret. Comput. Sci. 3 (1976), 23–33.

    Google Scholar 

  33. A. Yao, Separating the polynomial-time hierarchy by oracles, Proc. 26th IEEE Symp. Foundations of Computer Science, 1985, 1–10.

    Google Scholar 

  34. M. Zimand, On relativizations with restricted number of accesses to the oracle set, Math. Syst. Theory, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California, Santa Barbara, 93106, Santa Barbara, CA, USA

    Ronald V. Book

Authors
  1. Ronald V. Book
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz J. Brandenburg Guy Vidal-Naquet Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Book, R.V. (1987). Towards a theory of relativizations: Positive relativizations. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039591

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17219-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation