S.V. Lokam, Proceedings of IEEE 36th Annual Foundations of Computer Science, 1995, 6
Matthias P. Krieger, 3623, Fundamentals of Computation Theory, 2005, 32
Farid Ablayev, Marek Karpinski, 1099, Automata, Languages and Programming, 1996, 348
A. Beimel, A. Gal, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247), 1998, 68
Martin Sauerhoff, “Approximation of boolean functions by combinatorial rectangles”, Theoretical Computer Science, 301, № 1-3, 2003, 45
Stephen Ponzio, “A Lower Bound for Integer Multiplication with Read-Once Branching Programs”, SIAM J. Comput., 28, № 3, 1998, 798
Petr Savický, Stanislav Žák, “A lower bound on branching programs reading some bits twice”, Theoretical Computer Science, 172, № 1-2, 1997, 293
Ingo Wegener, “BDDs—design, analysis, complexity, and applications”, Discrete Applied Mathematics, 138, № 1-2, 2004, 229
Paul Beame, Michael Saks, Xiaodong Sun, Erik Vee, “Time-space trade-off lower bounds for randomized computation of decision problems”, J. ACM, 50, № 2, 2003, 154
Stasys Jukna, “Expanders and time-restricted branching programs”, Theoretical Computer Science, 409, № 3, 2008, 471