Preview
Unable to display preview. Download preview PDF.
References
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.
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.
A.K. Chandra, M.L. Furst, R.J. Lipton, Multi-party Protocols, ibidem, 94–99.
W. Masek, A Fast Algorithm for the String Editing Problem and Decision Graph Complexity, M.Sc. Thesis, M.I.T., May 1976.
I. Wegener, Optimal Decision Trees and One-time-only Branching Programs for Symmetric Boolean Functions, Interner Bericht 3/83, Fachbereich Informatik, Universität Frankfurt.
I. Wegener, private communication.
P. Pudlák, S. Žák, Space complexity of computations, manuscript, 1982.
S. Žák, Information in computation structures /preliminary version/, to appear in Acta Polytechnica.
P. Pudlák, A lower bound on complexity of branching programs, these proceedings.
Author information
Authors and Affiliations
Editor information
Rights 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