Languages with Bounded Multiparty Communication Complexity

DOI10.1007/978-3-540-70918-3_43zbMath1186.68249OpenAlexW1632935999MaRDI QIDQ3590958

Michal Koucký, Andreas Krebs, Arkadev Chattopadhyay, Denis Thérien, Mario Szegedy, Pascal Tesson

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_43

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (4)

Quivers of monoids with basic algebras ⋮ The NOF multiparty communication complexity of composed functions ⋮ A note on multiparty communication complexity and the Hales-Jewett theorem ⋮ An Algebraic Perspective on Boolean Function Learning

This page was built for publication: Languages with Bounded Multiparty Communication Complexity