It is well-known that any Boolean function f:{-1,+1}^n \to
{-1,+1} can be written uniquely as a polynomial f(x) = \sum_{S
subset [n]} f_s \prod_{i in S} x_i. The collection of coefficients
(f_S's) this expression are referred to (with good reason)...