Fourier sparsity and dimension

DOI10.4086/TOC.2019.V015A011zbMATH Open1477.94099OpenAlexW2982693763MaRDI QIDQ5204829FDOQ5204829

Authors: Swagato Sanyal 

Publication date: 5 December 2019

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

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

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

zbMATH Keywords

Fourier analysisBoolean functions

Mathematics Subject Classification ID

Boolean functions (94D10)

Cited In (8)

• Near-optimal upper bound on Fourier dimension of Boolean functions in terms of Fourier sparsity
• The list-decoding size of Fourier-sparse Boolean functions
• Theory of Sparse Coprime Sensing in Multiple Dimensions
• Testing Fourier Dimensionality and Sparsity
• Sparse generalized Fourier transforms
• Testing Fourier dimensionality and sparsity
• Fourier sparsity of \(\mathrm{GF}(2)\) polynomials
• The list-decoding size of Fourier-sparse Boolean functions

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)