On separating the read-k-times branching program hierarchy
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
On the nonapproximability of boolean Function by OBDDs and read-k-times Branching Programs
Information and Computation
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
On the P versus NP intersected with co-NP question in communication complexity
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
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
Hi-index | 0.00 |