DeepAI AI Chat
Log In Sign Up

Communication Complexity of Collision

by   Mika Göös, et al.

The Collision problem is to decide whether a given list of numbers (x_1,…,x_n)∈[n]^n is 1-to-1 or 2-to-1 when promised one of them is the case. We show an n^Ω(1) randomised communication lower bound for the natural two-party version of Collision where Alice holds the first half of the bits of each x_i and Bob holds the second half. As an application, we also show a similar lower bound for a weak bit-pigeonhole search problem, which answers a question of Itsykson and Riazanov (CCC 2021).


page 1

page 2

page 3

page 4


A New Approach to Multi-Party Peer-to-Peer Communication Complexity

We introduce new models and new information theoretic measures for the s...

An improved lower bound on the length of the longest cycle in random graphs

We provide a new lower bound on the length of the longest cycle of the b...

Detecting cliques in CONGEST networks

The problem of detecting network structures plays a central role in dist...

Quantum Lower Bound for a Tripartite Version of the Hidden Shift Problem

In this paper, we prove a polynomial lower bound of Ω(n^1/3) on the quan...

SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension

We show by reduction from the Orthogonal Vectors problem that algorithms...

A Simple Proof of a New Set Disjointness with Applications to Data Streams

The multiplayer promise set disjointness is one of the most widely used ...

The Communication Complexity of Optimization

We consider the communication complexity of a number of distributed opti...