Communication Complexity of Permutation-Invariant Functions

DOI10.1137/1.9781611974331.ch134zbMath1410.68129arXiv1506.00273OpenAlexW2950225593MaRDI QIDQ4575718

Pritish Kamath, Badih Ghazi

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.00273

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Communication with contextual uncertainty ⋮ Dimension Reduction for Polynomials over Gaussian Space and Applications

This page was built for publication: Communication Complexity of Permutation-Invariant Functions