Some Notes on the Information Flow in Read-Once Branching Programs
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.
Unable to display preview. Download preview PDF.
- 2.S. Jukna and S. Žák, On branching programs with bounded uncertainty. In: Proc. of ICALP’98, Springer LNCS 1443 (1998), 259–270. 357, 358, 359Google Scholar
- 4.Razborov, A. (1991): Lower bounds for deterministic and nondeterministic branching programs, in: Proc. FCT’91, Springer Lecture Notes in Computer Science 529, 47–60. 356Google Scholar
- 5.Wegener, I. (2000): Branching programs and Binary Decision Diagrams: Theory and Applications. SIAM Series in Discrete Mathematics and Applications. 356Google Scholar
- 6.S. Žák, Upper bounds for gentle branching programs, Tech. Rep. Nr. 788, Inst. of Comput. Sci., Czech Acad. of Sci., 1999. 357Google Scholar