Improved bounds for the randomized decision tree Complexity of recursive majority

Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao. Improved bounds for the randomized decision tree Complexity of recursive majority. Random Struct. Algorithms, 48(3):612-638, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.