Communication with Imperfectly Shared Randomness

DOI10.1145/2688073.2688099zbMath1364.68192arXiv1411.3603OpenAlexW2962713836MaRDI QIDQ2989037

Raghu Meka, Clément L. Canonne, Venkatesan Guruswami

Publication date: 19 May 2017

Published in: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

invariance principlecommunication complexityrandomness

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 ⋮ One-message secure reductions: on the cost of converting correlations

This page was built for publication: Communication with Imperfectly Shared Randomness