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
On BPP versus NP (semi-circle up) coNP for ordered read-once branching programs
Theoretical Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Approximations by OBDDs and the Variable Ordering Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Automata and Binary Decision Diagrams
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
A lower bound for integer multiplication on randomized ordered read-once branching programs
Information and Computation
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
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.01 |