On the communication complexity of high-dimensional permutations

Nati Linial, Toniann Pitassi, Adi Shraibman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

We study the multiparty communication complexity of high dimensional permutations in the Number On the Forehead (NOF) model. This model is due to Chandra, Furst and Lipton (CFL) who also gave a nontrivial protocol for the Exactly-n problem where three players receive integer inputs and need to decide if their inputs sum to a given integer n. There is a considerable body of literature dealing with the same problem, where (N, +) is replaced by some other abelian group. Our work can be viewed as a far-reaching extension of this line of research. We show that the known lower bounds for that group-theoretic problem apply to all high dimensional permutations. We introduce new proof techniques that reveal new and unexpected connections between NOF communication complexity of permutations and a variety of well-known problems in combinatorics. We also give a direct algorithmic protocol for Exactly-n. In contrast, all previous constructions relied on large sets of integers without a 3-term arithmetic progression.

Original languageAmerican English
Title of host publication10th Innovations in Theoretical Computer Science, ITCS 2019
EditorsAvrim Blum
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770958
DOIs
StatePublished - 1 Jan 2019
Event10th Innovations in Theoretical Computer Science, ITCS 2019 - San Diego, United States
Duration: 10 Jan 201912 Jan 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume124
ISSN (Print)1868-8969

Conference

Conference10th Innovations in Theoretical Computer Science, ITCS 2019
Country/TerritoryUnited States
CitySan Diego
Period10/01/1912/01/19

Bibliographical note

Publisher Copyright:
© Nati Linial, Toniann Pitassi, and Adi Shraibman.

Keywords

  • Additive combinatorics
  • High dimensional permutations
  • Number On the Forehead model

Fingerprint

Dive into the research topics of 'On the communication complexity of high-dimensional permutations'. Together they form a unique fingerprint.

Cite this