Skip to main content
SpringerLink
Log in

An exponential lower bound for one-time-only branching programs

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

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

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. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, C. Rackoff Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems, Proc. 20-th IEEE Symp. on Foundations of Computer Science, 1979, 218–223.

    Google Scholar 

  2. A. Borodin, D. Dolev, F.E. Fich, W.Paul Bounds for Width Two Branching Programs, 15th Annual ACM Symposium on Theory of Computing, 1983, 87–93.

    Google Scholar 

  3. A.K. Chandra, M.L. Furst, R.J. Lipton, Multi-party Protocols, ibidem, 94–99.

    Google Scholar 

  4. W. Masek, A Fast Algorithm for the String Editing Problem and Decision Graph Complexity, M.Sc. Thesis, M.I.T., May 1976.

    Google Scholar 

  5. I. Wegener, Optimal Decision Trees and One-time-only Branching Programs for Symmetric Boolean Functions, Interner Bericht 3/83, Fachbereich Informatik, Universität Frankfurt.

    Google Scholar 

  6. I. Wegener, private communication.

    Google Scholar 

  7. P. Pudlák, S. Žák, Space complexity of computations, manuscript, 1982.

    Google Scholar 

  8. S. Žák, Information in computation structures /preliminary version/, to appear in Acta Polytechnica.

    Google Scholar 

  9. P. Pudlák, A lower bound on complexity of branching programs, these proceedings.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Computation Techniques, Technical University, Horská 3, 128 00, Praha 2, Czechoslovakia

    Stanislav Žák

Authors
  1. Stanislav Žák
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Žák, S. (1984). An exponential lower bound for one-time-only branching programs. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030340

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation