The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Efficient data structures for Boolean functions
Discrete Mathematics - Special issue: trends in discrete mathematics
On lower bounds for read-k-times branching programs
Computational Complexity
A lower bound for integer multiplication with read-once branching programs
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
On the Power of Randomized Branching Programs
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
The Effect of Null-Chains on the Complexity of Contact Schemes
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Lower Bounds for Deterministic and Nondeterministic Branching Programs
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Some Separation Problems on Randomized OBBDs
Some Separation Problems on Randomized OBBDs
| Hi-index | 5.23 |
We investigate the relationship between probabilistic and nondeterministic complexity classes PP, BPP, NP and coNP with respect to ordered read-once branching programs (OBDDs). We exhibit two explicit Boolean functions qn; Rn such that: (1) qn : {0,1}n → { 0,1} belongs to BPP (NP (semi-circle up) coNP) in the context of OBDDs; (2) Rn : {0,1}n → {0,1} belongs to PP \ (BPP(semi-circle up) NP (semi-circle up) coNP) in the context of OBDDs. Both of these functions are not in AC0.