On separating the read-k-times branching program hierarchy
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Using 2-domain partitioned OBDD data structure in an enhanced symbolic simulator
ACM Transactions on Design Automation of Electronic Systems (TODAES)
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
On Average Time Complexity of Decision Trees and Branching Programs
Fundamenta Informaticae
Hi-index | 0.00 |