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 - Dyadic cubes - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Add to Reading List Document Date: 2012-08-28 19:20:30 Open Document File Size: 220,52 KB Share Result on Facebook Company Bernstein / Creative Commons / Gap / / IndustryTerm expected squared inner product / inner product / / Organization National Science Foundation / / Person Thomas Vidick Licensed / Thomas Vidick / Berry-Esseen Theorem / / / ProgrammingLanguage J / R / C / / URL http / SocialTag Normal distribution Proof theory Measure theory Dyadic cubes Ordinal arithmetic Mathematical analysis Statistics Gaussian measure

A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the Gap-Hamming-Distance problemAdd to Reading List