1 problem

Let $E_k(n)$ denote the extremal excess in the query complexity problem for Boolean functions on the slice $\binom{[n]}{k}$. The notation $E_k(n)=O(1)$ means that this excess is bo…