1 paper · 1 filter
Dmytro Gavinsky
We give a lower bound of Ω(n) on the unambiguous randomised parity-query complexity of the approximate majority problem -- that is, on the lowest randomised parity-query co…