Harmonic analysis, real approximation, and the communication complexity of Boolean functions
From MaRDI portal
Publication:1283682
DOI10.1007/PL00009265zbMath0917.68092OpenAlexW2159953367MaRDI QIDQ1283682
Publication date: 8 August 1999
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009265
Related Items (3)
Evaluating spectral norms for constant depth circuits with symmetric gates ⋮ On the power of circuits with gates of low \(L_{1}\) norms. ⋮ Lower bounds in communication complexity based on factorization norms
This page was built for publication: Harmonic analysis, real approximation, and the communication complexity of Boolean functions
