Christoph Meinel, Stephan Waack, 1046, STACS 96, 1996, 617
P. Savický, S. Žák, “A read-once lower bound and a (1,+k)-hierarchy for branching programs”, Theoretical Computer Science, 238, № 1-2, 2000, 347
Paul Beame, T.S. Jayram, Michael Saks, “Time–Space Tradeoffs for Branching Programs”, Journal of Computer and System Sciences, 63, № 4, 2001, 542
Farid Ablayev, 1256, Automata, Languages and Programming, 1997, 195
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk, “Identity Testing and Lower Bounds for Read- k Oblivious Algebraic Branching Programs”, ACM Trans. Comput. Theory, 10, № 1, 2018, 1
B. Bollig, M. Sauerhoff, I. Wegener, Proceedings 16th Annual IEEE Conference on Computational Complexity, 2000, 172
Farid Ablayev, Marek Karpinski, “A lower bound for integer multiplication on randomized ordered read-once branching programs”, Information and Computation, 186, № 1, 2003, 78
Anna Gál, Michal Koucký, Pierre McKenzie, 3967, Computer Science – Theory and Applications, 2006, 178
Martin Sauerhoff, 1373, STACS 98, 1998, 105
Matthias Homeister, “Lower bounds for restricted read-once parity branching programs”, Theoretical Computer Science, 359, № 1-3, 2006, 1