Multiparty communication complexity and very hard functions

DOI10.1016/j.ic.2004.03.002zbMath1087.68036OpenAlexW2157201449MaRDI QIDQ598239

Pavol Ďuriš

Publication date: 6 August 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.03.002

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Partition arguments in multiparty communication complexity, Construction of Very Hard Functions for Multiparty Communication Complexity

Cites Work

• Lower bounds on communication complexity
• Construction of Very Hard Functions for Multiparty Communication Complexity
• Optimal lower bounds on the multiparty communication complexity
• Communication Complexity