http://theoryofcomputing.org     ISSN 1557-2862
Endorsed by ACM SIGACT
Volume 3 (2007) Article 11 pp. 211-219
The Randomized Communication Complexity of Set Disjointness
by
Published: October 15, 2007
[PDF (120K)]    [PS (209K)]    [PS.GZ (61K)]
[Source ZIP]
Keywords: communication complexity, randomized protocol, set disjointness
Categories: short, complexity theory, algorithms, communication complexity
ACM Classification: F.2.2
AMS Classification: 68Q25

Abstract: [Plain Text Version]

We study the communication complexity of the disjointness function, in which each of two players holds a $k$-subset of a universe of size $n$ and the goal is to determine whether the sets are disjoint. In the model of a common random string we prove that $O(k)$ communication bits are sufficient, regardless of $n$. In the model of private random coins $O(k + \log {\log n})$ bits suffice. Both results are asymptotically tight.
{"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": 5, "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": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "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.8834006190299988, "perplexity_flag": "middle"}