K. Khadiev, “On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-k-times branching programs”, Lobachevskii J Math, 37, № 6, 2016, 683
Petr Savický, Detlef Sieling, “A hierarchy result for read-once branching programs with restricted parity nondeterminism”, Theoretical Computer Science, 340, № 3, 2005, 594
S. Jukna, A. Razborov, “Neither reading few bits twice nor reading illegally helps much”, Discrete Applied Mathematics, 85, № 3, 1998, 223
Anna Gál, Michal Koucký, Pierre McKenzie, “Incremental Branching Programs”, Theory Comput Syst, 43, № 2, 2008, 159
Stasys Jukna, “Limitations of Incremental Dynamic Programming”, Algorithmica, 69, № 2, 2014, 461
E. A. Okol’nishnikova, “A lower bound on the computation complexity of characteristic functions for BCH-codes by branching programs”, J. Appl. Ind. Math., 4, № 2, 2010, 231
Allan Borodin, 762, Algorithms and Computation, 1993, 209
I. Wegener, P. Woelfel, 20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005, 100
Igor Razgon, “On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth”, Theory Comput Syst, 61, № 3, 2017, 755
Beate Bollig, Martin Sauerhoff, Ingo Wegener, “On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs”, Information and Computation, 178, № 1, 2002, 263