13 citations · 25 across the 15 of their papers we have counts for
1 paper · 2 filters
Eric Blais, Li-Yang Tan, Andrew Wan
We give a new bound on the sum of the linear Fourier coefficients of a Boolean function in terms of its parity decision tree complexity. This result generalizes an inequality of O'…