Comparing the sizes of nondeterministic branching read-k-times programs
Discrete Applied Mathematics
Pebbles and Branching Programs for Tree Evaluation
ACM Transactions on Computation Theory (TOCT)
On some bounds on the size of branching programs (a survey)
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
| Hi-index | 0.00 |