The randomized communicatin complexity of set disjointness
2007 (English)In: Theory of Computing, ISSN 1557-2862, Vol. 3, 211-219 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2007. Vol. 3, 211-219 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-62995DOI: 10.4086/toc.2007.v003a011OAI: oai:DiVA.org:kth-62995DiVA: diva2:481475
QC 201201232012-01-212012-01-212012-01-23Bibliographically approved