Spectral norm of symmetric functions
From MaRDI portal
Abstract: The spectral norm of a Boolean function 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 where , and and are the smallest integers less than such that or is constant for all with . We mention some applications to the decision tree and communication complexity of symmetric functions.
Recommendations
Cited in
(14)- Spectra with positive elementary symmetric functions
- Spectral properties of threshold functions
- Evaluating spectral norms for constant depth circuits with symmetric gates
- Boolean functions with small spectral norm
- A geometrical representation of the Fourier transformation of Boolean functions
- Complexity theoretic aspects of some cryptographic functions
- Spectral functions of a symmetric linear relation with a directing mapping, I
- Spectral functions of a symmetric linear relation with a directing mapping, II
- scientific article; zbMATH DE number 2114156 (Why is no real title available?)
- scientific article; zbMATH DE number 7561760 (Why is no real title available?)
- A lifting theorem with applications to symmetric functions
- Boolean functions with small spectral norm, revisited
- Fourier sparsity of \(\mathrm{GF}(2)\) polynomials
- scientific article; zbMATH DE number 3101046 (Why is no real title available?)
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)