A three-party communication problem

DOI10.1006/jcss.1998.1603zbMath0917.68095OpenAlexW2040311504MaRDI QIDQ1278045

Leonard J. Schulman

Publication date: 21 February 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1998.1603

zbMATH Keywords

deterministic communication complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

Estimating the density of a conditional expectation

Cites Work

• Unnamed Item
• Communication Complexity

This page was built for publication: A three-party communication problem