Spectral norm of symmetric functions

From MaRDI portal



Abstract: The spectral norm of a Boolean function f:0,1no−1,1 is the sum of the absolute values of its Fourier coefficients. This quantity provides useful upper and lower bounds on the complexity of a function in areas such as learning theory, circuit complexity, and communication complexity. In this paper, we give a combinatorial characterization for the spectral norm of symmetric functions. We show that the logarithm of the spectral norm is of the same order of magnitude as r(f)log(n/r(f)) where r(f)=maxr0,r1, and r0 and r1 are the smallest integers less than n/2 such that f(x) or f(x)cdotparity(x) is constant for all x with sumxiin[r0,n−r1]. We mention some applications to the decision tree and communication complexity of symmetric functions.











This page was built for publication: Spectral norm of symmetric functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167408)