225 citations · 582 across the 52 of their papers we have counts for
1 paper · 2 filters
Frederic Magniez, Ashwin Nayak, Miklos Santha +3
We consider the randomized decision tree complexity of the recursive 3-majority function. We prove a lower bound of (1/2−δ)⋅2.57143h for the two-sided-error randomized dec…