Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
On the complexity of branching programs and decision trees for clique functions
Journal of the ACM (JACM)
Entropy of contact circuits and lower bounds on their complexity
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Polynomial size &OHgr;-branching programs and their computational power
Information and Computation
Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
Theoretical Computer Science
On lower bounds for read-k-times branching programs
Computational Complexity
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time
MFCS '90 Proceedings of the Mathematical Foundations of Computer Science 1990
An Exponential Lower Bound for One-Time-Only Branching Programs
Proceedings of the Mathematical Foundations of Computer Science 1984
On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Lower Bounds for Deterministic and Nondeterministic Branching Programs
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
A Lower Bound Technique for Restricted Branching Programs and Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
Restricted branching programs are considered in complexity theory in order to study the space complexity of sequential computations and in applications as a data structure for Boolean functions. In this paper (⊕, k)-branching programs and (∨, k)-branching programs are considered, i.e., branching programs starting with a ⊕- (or ∨-)node with a fan-out of k whose successors are k read-once branching programs. This model is motivated by the investigation of the power of nondeterminism in branching programs and of similar variants that have been considered as a data structure. Lower bound methods for these variants of branching programs are presented, which allow to prove even hierarchy results for polynomial size (⊕; k)- and (∨, k)-branching programs with respect to k.