Skip to main content
SpringerLink
Log in

Collapsing oracle hierarchies, census functions and logarithmically many queries

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 88 (STACS 1988)

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

Included in the following conference series:

Abstract

Using a uniform method based on a technique by Kadin [5], many oracle and alternation hierarchies can be shown to collapse to their level Δ2. This improves in different respects earlier such collapse results in [3], [4] and [13]. Our results on space hierarchy classes have been improved since the first version of this paper by Immerman [8] who showed a collapse to level Σ1.

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.

4. References

  1. Beigel, R.J., A structural theorem that depends quantitatively on the complexity of SAT, Proc. of 2nd Conference on Structure in Complexity Theory (1987), 28–32.

    Google Scholar 

  2. Gasarch, W., The complexity of optimization functions, TR 1652 (1986), Dept. of Computer Science, University of Maryland.

    Google Scholar 

  3. Hemachandra, L.A., The strong exponential hierarchy collapses, Proc. 19th. STOC Conference (1987), 110–122; see also Proc. of 2nd Conference on Structure in Complexity Theory (1987), 91.

    Google Scholar 

  4. Immerman, N., Nondeterministic space is closed under complement, YALEU/DCS/TR 552, 1987.

    Google Scholar 

  5. Kadin, J., PNP[log n] and sparse Turing-complete sets for NP, Proc. of 2nd Conference on Structure in Complexity Theory (1987), 33–40.

    Google Scholar 

  6. Krentel, M.W., The complexity of optimization problems, Proc. 18th. Ann. STOC Conference (1986), 69–76.

    Google Scholar 

  7. Lange, K.-J., Jenner, B., Kirsig, B., The logarithmic alternation hierarchy collapses: AΣ L2 =A∏ L2 , Proc. of 14th ICALP, LNCS 267 (1987), 531–541.

    Google Scholar 

  8. Ladner, R.E., Lynch, N.A., Relativizations of questions about log space computability, Math.Syst.Theory 10(1976), 19–32.

    Google Scholar 

  9. Mahaney, S., Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis, Journ. of Comp. and Syst. Sci. 25(1982), 130–143.

    Google Scholar 

  10. Papadimitriou, C.H., Zachos, S.K., Two remarks on the power of counting,Proc. 6th. GI Conference on Theoretical Computer Science, LNCS 145 (1983), 269–276.

    Google Scholar 

  11. Ruzzo, W., Simon, J., Tompa, M., Space-bounded hierarchies and probabilistic computations, Journ. of Comp. and Syst. Sci. 28(1984), 216–230.

    Google Scholar 

  12. Schöning, U., Wagner, K.W., Collapsing oracle hierarchies, census functions and logarithmically many queries, Techn. Report No.140, Institut of Mathematics, University of Augsburg, April 1987.

    Google Scholar 

  13. Toda, S., Σ2SPACE(n) is closed under complement, JCSS 35 (1987), 145–152.

    Google Scholar 

  14. Wagner, K.W., More complicated questions about maxima and minima, and some closures of NP, Proc. of 13th ICALP, LNCS 226 (1986), 434–443, see also: TCS 51(1987), 53–80.

    Google Scholar 

  15. Wagner, K.W., Bounded query classes, Report No. 157 (1987), Institute of Mathematics, University of Augsburg.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Seminar für Informatik, EWH Koblenz, Rheinau 3-4, D - 5400, Koblenz

    Uwe Schöning

  2. Institut für Mathematik, Universität Augsburg, Memminger Str. 6, D - 8900, Augsburg

    Klaus W. Wagner

Authors
  1. Uwe Schöning
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus W. Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Cori Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schöning, U., Wagner, K.W. (1988). Collapsing oracle hierarchies, census functions and logarithmically many queries. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035835

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation