One-way communication complexity of symmetric Boolean functions.

DOI10.1007/B11926MaRDI QIDQ5900794zbMATH OpenOpenAlexFDO

Authors Jan Arpe, Andreas Jakoby, Maciej Liśkiewicz

Publication date 20 April 2010

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

Full work available at URL https://doi.org/10.1007/b11926

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Two-way communication complexity of sum-type functions for one processor to be informed
• Tight bounds on communication complexity of symmetric XOR functions in one-way and SMP models
• Harmonic analysis, real approximation, and the communication complexity of Boolean functions
• Different Modes of Communication
• Communication complexities of symmetric XOR functions

Cited in

(1)

• Two-way communication complexity of sum-type functions for one processor to be informed

This page was built for publication: One-way communication complexity of symmetric Boolean functions.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900794)