The BNS-Chung criterion for multi-party communication complexity

DOI10.1007/PL00001602zbMath0971.68067OpenAlexW1985293484MaRDI QIDQ5930151

Ran Raz

Publication date: 17 April 2001

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00001602

zbMATH Keywords

multi-party communication complexity

Mathematics Subject Classification ID

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

Related Items (10)

Hellinger volume and number-on-the-forehead communication complexity ⋮ Hadamard tensors and lower bounds on multiparty communication complexity ⋮ Unnamed Item ⋮ Interleaved Group Products ⋮ The NOF multiparty communication complexity of composed functions ⋮ The communication complexity of addition ⋮ One-way multiparty communication lower bound for pointer jumping with applications ⋮ Quantum multiparty communication complexity and circuit lower bounds ⋮ Unnamed Item ⋮ Pseudorandom Functions: Three Decades Later

This page was built for publication: The BNS-Chung criterion for multi-party communication complexity