Languages with Bounded Multiparty Communication Complexity

Download PDF
Open Webpage

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

Published: 2007, Last Modified: 27 Jul 2025STACS 2007EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We study languages with bounded communication complexity in the multiparty “input on the forehead model” with worst-case partition. In the two-party case, languages with bounded complexity are exactly those recognized by programs over commutative monoids [19]. This can be used to show that these languages all lie in shallow ACC0.