Optimal lower bounds on the multiparty communication complexity

DOI10.1007/3-540-59042-0_87zbMath1379.68129OpenAlexW1551208484MaRDI QIDQ4596635

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

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_87

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Multiparty communication complexity and very hard functions, Construction of Very Hard Functions for Multiparty Communication Complexity