Harmonic analysis, real approximation, and the communication complexity of Boolean functions

DOI10.1007/PL00009265zbMath0917.68092MaRDI QIDQ1283682

Vince Grolmusz

Publication date: 8 August 1999

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

two-party communication complexity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

Related Items

Lower bounds in communication complexity based on factorization norms, On the power of circuits with gates of low \(L_{1}\) norms., Evaluating spectral norms for constant depth circuits with symmetric gates