One-Round Multi-Party Communication Complexity of Distinguishing Sums

TL;DR

This paper investigates the minimal one-round communication needed for multiple parties to determine the sum of their inputs, providing tight bounds using additive combinatorics for sum-distinguishing problems.

Contribution

It establishes tight bounds on one-round communication complexity for sum-distinguishing problems, combining elementary additive combinatorics with communication complexity analysis.

Findings

Tight bounds for sum-distinguishing problems in one-round protocols.

Application of additive combinatorics to communication complexity.

Elementary proofs for bounds on sum-based functions.

Abstract

We consider an instance of the following problem: Parties P_1,..., P_k each receive an input x_i, and a coordinator (distinct from each of these parties) wishes to compute f(x_1,..., x_k) for some predicate f. We are interested in one-round protocols where each party sends a single message to the coordinator; there is no communication between the parties themselves. What is the minimum communication complexity needed to compute f, possibly with bounded error? We prove tight bounds on the one-round communication complexity when f corresponds to the promise problem of distinguishing sums (namely, determining which of two possible values the {x_i} sum to) or the problem of determining whether the {x_i} sum to a particular value. Similar problems were studied previously by Nisan and in concurrent work by Viola. Our proofs rely on basic theorems from additive combinatorics, but are otherwise elementary.