Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
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
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
On lower bounds for read-k-times branching programs
Computational Complexity
On P versus NP CO-NP for decision trees and read-once branching programs
Computational Complexity
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Time-space tradeoffs for branching programs
Journal of Computer and System Sciences
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
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
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
Journal of Computer and System Sciences
Lower bounds for restricted read-once parity branching programs
Theoretical 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 and hierarchy results for polynomial size (⊕, k)- and (∨, k)-branching programs with respect to k are presented.