Fourier sparsity and dimension

DOI10.4086/TOC.2019.V015A011MaRDI QIDQ5204829zbMATH OpenOpenAlexFDO

Authors Swagato Sanyal

Publication date 5 December 2019

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2019.v015a011

zbMATH Keywords

Boolean functionsFourier analysis

Mathematics Subject Classification ID

Boolean functions (94D10)

Recommendations

• Near-optimal upper bound on Fourier dimension of Boolean functions in terms of Fourier sparsity
• Testing Fourier dimensionality and sparsity
• Testing Fourier Dimensionality and Sparsity
• The list-decoding size of Fourier-sparse Boolean functions
• The list-decoding size of Fourier-sparse Boolean functions

Cited in

(12)

• Near-optimal upper bound on Fourier dimension of Boolean functions in terms of Fourier sparsity
• Theory of Sparse Coprime Sensing in Multiple Dimensions
• The list-decoding size of Fourier-sparse Boolean functions
• The list-decoding size of Fourier-sparse Boolean functions
• Fourier sparsity of \(\mathrm{GF}(2)\) polynomials
• Testing Fourier dimensionality and sparsity
• Testing Fourier Dimensionality and Sparsity
• On parity decision trees for Fourier-sparse Boolean functions
• One-way communication complexity of partial XOR functions
• On parity decision trees for Fourier-sparse Boolean functions
• On Fourier analysis of sparse Boolean functions over certain abelian groups
• Sparse generalized Fourier transforms

This page was built for publication: Fourier sparsity and dimension

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