The composition complexity of majority

Abstract

We study the complexity of computing majority as a composition of local functions:where each g j : {0, 1} n → {0, 1} is an arbitrary function that queries only k n variables and h : {0, 1} m → {0, 1} is an arbitrary combining function. We prove an optimal lower bound of