http://theoryofcomputing.org     ISSN 1557-2862
Endorsed by ACM SIGACT
Volume 8 (2012) Article 8 pp. 197-208
The Communication Complexity of Gap Hamming Distance
by
In the gap Hamming distance problem, two parties must determine whether their respective strings $x,y\in\{0,1\}^n$ are at Hamming distance less than $n/2-\sqrt n$ or greater than $n/2+\sqrt n.$ In a recent tour de force, Chakrabarti and Regev (2010) proved the long-conjectured $\Omega(n)$ bound on the randomized communication complexity of this problem. In follow-up work, Vidick (2010) discovered a simpler proof. We contribute a new proof, which is simpler yet and a page-and-a-half long.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 4, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8214447498321533, "perplexity_flag": "middle"}