On Fourier analysis of sparse Boolean functions over certain abelian groups
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7053345 (Why is no real title available?)
- scientific article; zbMATH DE number 7799588 (Why is no real title available?)
- A polynomial bound in Freiman's theorem.
- Approximate Constraint Satisfaction Requires Large LP Relaxations
- Boolean functions with small spectral norm
- Chvátal's conjecture and correlation inequalities
- Derandomized learning of Boolean functions over finite abelian groups
- Fast Fourier sparsity testing
- Finding significant Fourier coefficients: clarifications, simplifications, applications and limitations
- Fourier sparsity and dimension
- Fourier sparsity, spectral norm, and the log-rank conjecture
- Lower bounds of functions on finite abelian groups
- Nearly optimal sparse Fourier transform
- On lattices, learning with errors, random linear codes, and cryptography
- On parity decision trees for Fourier-sparse Boolean functions
- On sparse reconstruction from Fourier and Gaussian measurements
- Optimality of linear sketching under modular updates
- Pseudorandom generators and learning algorithms for \(\mathrm{AC}^0\)
- Reconstruction under outliers for Fourier-sparse functions
- Sampling Boolean functions over Abelian groups and applications
- Sampling-based proofs of almost-periodicity results and algorithmic applications
- Spectral analysis of Boolean functions as a graph eigenvalue problem
- Structure of protocols for XOR functions
- Testing Fourier dimensionality and sparsity
- The list-decoding size of Fourier-sparse Boolean functions
This page was built for publication: On Fourier analysis of sparse Boolean functions over certain abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241042)
