Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with gap-hamming:
TR11-051 | 8th April 2011
Thomas Vidick

A concentration inequality for the overlap of a vector on a large set, With application to the communication complexity of the Gap-Hamming-Distance problem

Given two sets $A,B\subseteq\R^n$, a measure of their dependence, or correlation, is given by the expected squared inner product between random $x\in A $ and $y\in B$. We prove an inequality showing that no two sets of large enough Gaussian measure (at least $e^{-\delta n}$ for some constant $\delta >0$) ... more >>>

TR20-006 | 22nd January 2020
Anup Rao, Amir Yehudayoff

The Communication Complexity of the Exact Gap-Hamming Problem

We prove a sharp lower bound on the distributional communication complexity of the exact gap-hamming problem.

more >>>

ISSN 1433-8092 | Imprint