A majority lemma for randomised query complexity

Abstract

We show that computing the majority of n copies of a boolean function g has randomised query complexity [EQUATION]. In fact, we show that to obtain a similar result for any composed function f ο gn, it suffices to prove a sufficiently strong form of the result only in the special case g = GAPOr.