Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity

DOI10.1007/978-3-662-47672-7_84zbMath1440.94112OpenAlexW2395817454MaRDI QIDQ3448858

Swagato Sanyal

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47672-7_84

Mathematics Subject Classification ID

Boolean functions (94D10)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

• On the structure of Boolean functions with small spectral norm
• Communication is Bounded by Root of Rank
• Testing Fourier Dimensionality and Sparsity

This page was built for publication: Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity