Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Separating complexity classes related to bounded alternating Ω-branching programs

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1993)

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

Included in the following conference series:

  • 154 Accesses

Abstract

By means of algebraical rank arguments we derive some exponential lower bounds on the size of bounded alternating Ω-branching programs. Together with some polynomial upper bounds these lower bounds make possible the complete separation of the restricted complexity classes NL ba, co-NL ba, ⊕L ba, MOD p-L ba, p prime.

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. N. Alon, W. Maass: Meanders, Ramsey theory and lower bounds, Proc. 27th ACM STOC, 1986, 30–39.

    Google Scholar 

  2. A. Borodin, A. Razborov, R. Smolensky: On lower bounds for read-κ times branching programs, Comput. Complexity 3 (1993), 1–18.

    Article  Google Scholar 

  3. D. Damm, M. Krause, Ch. Meinel, S. Waack: Separating Restricted MODp-Branching Program Classes, Proc. STACS'92, LNCS 577, 281–292, 1992.

    Google Scholar 

  4. M. Krause, Ch. Meinel, S. Waack: Separating Complexity Classes Related to Certain Input Oblivious Logarithmic Space Bounded Turing Machines, Proc. 4th IEEE Structure in Complexity Theory, 1989, 240–259.

    Google Scholar 

  5. M. Krause: Separating ⊕L from L, co-NL and AL=P for Oblivious Turing Machines of Linear Access Time, Proc. MFCS'90, LNCS 452, 385–391.

    Google Scholar 

  6. C. Y. Lee: Representation of Switching Functions by Binary Decision Programs, Bell System Techn. Journal 38 (1959), 985–999.

    Google Scholar 

  7. Ch. Meinel: Polynomial Size Ω-Branching Programs and Their Computational Power, Proc. STACS'88, LNCS 294, 81-90.

    Google Scholar 

  8. Ch. Meinel: Modified Branching Programs and Their Computational Power, LNCS 370, Springer Verlag, 1989.

    Google Scholar 

  9. Ch. Meinel, S. Waack: Upper and Lower Bounds for Certain Graph-Accessibility-Problems on Bounded Alternating Branching Programs, MFCS'91, LNCS 520, 337–345.

    Google Scholar 

  10. P. Pudlák, S. Žak: Space Complexity of Computations, Preprint Univ. of Prague, 1983.

    Google Scholar 

  11. S. Žak: An Exponential Lower Bound for One-Time-Only Branching Programs, Proc. MFCS'84, LNCS 176, 562–66.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB IV-Informatik, Universität Trier, D-54286, Trier

    Christoph Meinel

  2. Inst. für Num. u. Angew. Mathematik, Georg-August-Universität, D-37083, Göttingen

    Stephan Waack

Authors
  1. Christoph Meinel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephan Waack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meinel, C., Waack, S. (1993). Separating complexity classes related to bounded alternating Ω-branching programs. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_269

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_269

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation