The Complexity of Algorithms Computing Game Trees on Random Assignments
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
On directional vs. undirectional randomized decision tree complexity for read-once formulas
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Bounding the randomized decision tree complexity of read-once Boolean functions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |