The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems

DOI10.1007/11821069_13zbMath1132.68419OpenAlexW1529492988MaRDI QIDQ5756728

Richard Beigel, James Glenn, William I. Gasarch

Publication date: 5 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols ⋮ Nondeterministic communication complexity with help and graph functions ⋮ Finding large 3-free sets. I. The small \(n\) case ⋮ The NOF multiparty communication complexity of composed functions ⋮ Unnamed Item ⋮ A note on multiparty communication complexity and the Hales-Jewett theorem

This page was built for publication: The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems