Lower bounds on the multiparty communication complexity

DOI10.1006/jcss.1997.1547zbMath0917.94024OpenAlexW2016981839MaRDI QIDQ1267715

Pavol Ďuriš, José D. P. Rolim

Publication date: 8 December 1998

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

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

zbMATH Keywords

algorithmic information theoryBoolean functionslower boundsmultiparty communication complexity

Mathematics Subject Classification ID

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

Related Items

The Range of Topological Effects on Communication, Partition arguments in multiparty communication complexity, Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy, The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model, Unnamed Item

Cites Work

• Communication complexity
• Lower bounds on communication complexity