Annual Symposium on Theoretical Aspects of Computer Science

STACS 2007: STACS 2007 pp 500-511

Languages with Bounded Multiparty Communication Complexity

  • Arkadev Chattopadhyay
  • Andreas Krebs
  • Michal Koucký
  • Mario Szegedy
  • Pascal Tesson
  • Denis Thérien
Conference paper

DOI: 10.1007/978-3-540-70918-3_43

Volume 4393 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Chattopadhyay A., Krebs A., Koucký M., Szegedy M., Tesson P., Thérien D. (2007) Languages with Bounded Multiparty Communication Complexity. In: Thomas W., Weil P. (eds) STACS 2007. STACS 2007. Lecture Notes in Computer Science, vol 4393. Springer, Berlin, Heidelberg

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.

In contrast, we use coding techniques to show that there are languages of arbitrarily large circuit complexity which can be recognized in constant communication by k players for k ≥ 3. However, we show that if a language has a neutral letter and bounded communication complexity in the k-party game for some fixed k then the language is in fact regular. We give an algebraic characterization of regular languages with this property. We also prove that a symmetric language has bounded k-party complexity for some fixed k iff it has bounded two party complexity.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Arkadev Chattopadhyay
    • 1
  • Andreas Krebs
    • 2
  • Michal Koucký
    • 3
  • Mario Szegedy
    • 4
  • Pascal Tesson
    • 5
  • Denis Thérien
    • 1
  1. 1.School of Computer Science, McGill University, Montreal 
  2. 2.Universität TübingenGermany
  3. 3.Mathematical Institute, Academy of SciencesCzech Republic
  4. 4.Rutgers University, New Jersey 
  5. 5.Laval University, Québec