On separating the read-k-times branching program hierarchy
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On BPP versus NP (semi-circle up) coNP for ordered read-once branching programs
Theoretical Computer Science
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On Computational Power of Quantum Branching Programs
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Separating Oblivious and Non-oblivious BPs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A lower bound for integer multiplication on randomized ordered read-once branching programs
Information and Computation
On the computational power of probabilistic and quantum branching program
Information and Computation
On the computational power of probabilistic and quantum branching program
Information and Computation
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
On the size of randomized OBDDs and read-once branching programs for k-stable functions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Randomized OBDDs for the most significant bit of multiplication need exponential space
Information Processing Letters
Randomized OBDDs for the most significant bit of multiplication need exponential size
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
The complexity of classical and quantum branching programs: a communication complexity approach
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Hi-index | 0.00 |