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
The nonapproximability of OBDD minimization
Information and Computation
On the nonapproximability of boolean Function by OBDDs and read-k-times Branching Programs
Information and Computation
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
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Separating Oblivious and Non-oblivious BPs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
Journal of Computer and System Sciences
Information Processing Letters
Information Processing Letters
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
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Hi-index | 0.00 |