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

DOI10.1007/3-540-61332-3_147zbMath1529.68107OpenAlexW2134225805MaRDI QIDQ6184658

Vince Grolmusz

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-B770-0

Mathematics Subject Classification ID

Boolean functions (06E30) Communication complexity, information complexity (68Q11)

Cites Work

• On the power of small-depth threshold circuits
• Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
• The BNS lower bound for multi-party protocols is nearly optimal
• A weight-size trade-off for circuits with MOD m gates
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Harmonic analysis, real approximation, and the communication complexity of Boolean functions