Optimal lower bounds on the multiparty communication complexity
From MaRDI portal
Publication:4596635
DOI10.1007/3-540-59042-0_87zbMATH Open1379.68129OpenAlexW1551208484MaRDI QIDQ4596635FDOQ4596635
Authors: Pavol Ďuriš, José 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
Recommendations
- Lower bounds on the multiparty communication complexity
- Harmonic analysis, real approximation, and the communication complexity of Boolean functions
- Upper bounds on multiparty communication complexity of shifts
- Partition arguments in multiparty communication complexity
- Lower bounds for number-in-hand multiparty communication complexity, made easy
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (16)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiparty communication complexity and very hard functions
- Construction of Very Hard Functions for Multiparty Communication Complexity
- Upper bounds on multiparty communication complexity of shifts
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- Title not available (Why is that?)
- Languages with Bounded Multiparty Communication Complexity
- Communication Complexity of Simultaneous Messages
- The BNS lower bound for multi-party protocols is nearly optimal
- Lower bounds in communication complexity
- A note on multiparty communication complexity and the Hales-Jewett theorem
- The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
- Lower bounds on the multiparty communication complexity
- Automata, Languages and Programming
- Title not available (Why is that?)
This page was built for publication: Optimal lower bounds on the multiparty communication complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596635)
