Abstract
In this paper we describe a lower bounds argument for read-once branching programs which is not just a standard cut-and-paste. The argument is based on a more subtle analysis of the information flow during the individual computations. Although the same lower bound can be also obtained by standard arguments, our proof may be promising because (unlike the cut-and-paste argument) it can potentially be extended to more general models.
Supported by GA ČR, grant No. 201/98/0717.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Bollig and I. Wegener, A very simple function that requires exponential size read-once branching programs, Inf. Process. Letters 66 (1998), 53–58. 360
S. Jukna and S. Žák, On branching programs with bounded uncertainty. In: Proc. of ICALP’98, Springer LNCS 1443 (1998), 259–270. 357, 358, 359
E. I. Nechiporuk, On a Boolean function, Soviet Mathematics Doklady 7:4 (1966), 999–1000. (In Russian).
Razborov, A. (1991): Lower bounds for deterministic and nondeterministic branching programs, in: Proc. FCT’91, Springer Lecture Notes in Computer Science 529, 47–60. 356
Wegener, I. (2000): Branching programs and Binary Decision Diagrams: Theory and Applications. SIAM Series in Discrete Mathematics and Applications. 356
S. Žák, Upper bounds for gentle branching programs, Tech. Rep. Nr. 788, Inst. of Comput. Sci., Czech Acad. of Sci., 1999. 357
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jukna, S., Žák, S. (2000). Some Notes on the Information Flow in Read-Once Branching Programs. In: Hlaváč, V., Jeffery, K.G., Wiedermann, J. (eds) SOFSEM 2000: Theory and Practice of Informatics. SOFSEM 2000. Lecture Notes in Computer Science, vol 1963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44411-4_24
Download citation
DOI: https://doi.org/10.1007/3-540-44411-4_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41348-6
Online ISBN: 978-3-540-44411-4
eBook Packages: Springer Book Archive