Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1993: STACS 93 pp 5–15Cite as

Alternation for two-way machines with sublogarithmic space

  • Conference paper
  • First Online:

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

Abstract

The alternation hierarchy for two-way Turing machines with a space bound in o(log) does not collapse below level five.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Babai and S. Moran. Arthur-Merlin games: a randomized proof-system, and a hierarchy of complexity classes. Journal of Computer and System Sciences 36 (1988) 254–276, 36:254–276, 1988.

    Google Scholar 

  2. B. v. Braunmühl. Alternationshierarchien von Turingmaschinen mit kleinem Speicher. Informatik Berichte 83, Inst. für Informatik, Universität Bonn, 1991.

    Google Scholar 

  3. J. Hastad. Almost optimal lower bounds for small depth circuits. In Proc. 18. STOC, pages 6–20, 1986.

    Google Scholar 

  4. L. A. Hemachandra. The strong exponential hierarchy collapses. In Proc. 19th. STOC Conference, pages 110–122, 1987.

    Google Scholar 

  5. A. Ito, K. Inoue, and I. Takanami. A note on alternating Turing machines using small space. The Transactions of the IEICE, E 70 no. 10:990–996, 1987.

    Google Scholar 

  6. N. Immerman. NSPACE is closed under complement. SIAM J. Comput., 17:935–938, 1988.

    Google Scholar 

  7. M. Liśkiewicz and K. Loryś. On reversal complexity for alternating Turing machines. In Proc. 30st Ann. Symp. on Foundations of Computer Science, pages 618–623, 1989.

    Google Scholar 

  8. P. M. Lewis, R. E. Stearns, and J. Hartmanis. Memory bounds for recognition of context-free and context-sensitive languages. In IEEE Conf. Switch. Circuit Theory and Logic Design, pages 191–202, 1965.

    Google Scholar 

  9. U. Schöning and K. W. Wagner. Collapsing oracle hierarchies, census functions and logarithmically many queries. In Proc. 5th. STACS 88, LNCS 294, pages 91–97, 1988.

    Google Scholar 

  10. R. Szelepcsényi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279–284, 1988.

    Google Scholar 

  11. A. Yao. Separating the polynomial time hierarchy by oracles. In Proc. 26th. FoCS, pages 1–10, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik I, Universität Bonn, Römerstrasse 164, D-5300, Bonn 1

    Burchard von Braunmühl

Authors
  1. Burchard von Braunmühl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Enjalbert A. Finkel K. W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

von Braunmühl, B. (1993). Alternation for two-way machines with sublogarithmic space. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-56503-5_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56503-1

  • Online ISBN: 978-3-540-47574-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation