Lower bounds on the multiparty communication complexity
From MaRDI portal
Publication:1267715
DOI10.1006/jcss.1997.1547zbMath0917.94024OpenAlexW2016981839MaRDI QIDQ1267715
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
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