Inner Product and Set Disjointness: Beyond Logarithmically Many Parties

11/29/2017
by   Vladimir V. Podolskii, et al.
0

A basic goal in complexity theory is to understand the communication complexity of number-on-the-forehead problems f({0,1}^n)^k→{0,1} with k≫ n parties. We study the problems of inner product and set disjointness and determine their randomized communication complexity for every k≥ n, showing in both cases that Θ(1+ n/1+k/ n) bits are necessary and sufficient. In particular, these problems admit constant-cost protocols if and only if the number of parties is k≥ n^ϵ for some constant ϵ>0.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/24/2022

Communication Complexity of Inner Product in Symmetric Normed Spaces

We introduce and study the communication complexity of computing the inn...
research
06/08/2018

Compressed Communication Complexity of Longest Common Prefixes

We consider the communication complexity of fundamental longest common p...
research
04/25/2018

Interleaved group products

Let G be the special linear group SL(2,q). We show that if (a_1,...,a_t)...
research
11/06/2019

Quantum versus Randomized Communication Complexity, with Efficient Players

We study a new type of separation between quantum and classical communic...
research
07/28/2023

Swiper and Dora: efficient solutions to weighted distributed problems

The majority of fault-tolerant distributed algorithms are designed assum...
research
05/21/2020

Communication Complexity of Distributed High Dimensional Correlation Testing

Two parties observe independent copies of a d-dimensional vector and a s...
research
01/05/2021

Methods for computing b-functions associated with μ-constant deformations – Case of inner modality 2 –

New methods for computing parametric local b-functions are introduced fo...

Please sign up or login with your details

Forgot password? Click here to reset