Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The randomized communicatin complexity of set disjointness
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0002-5379-345X
2007 (English)In: Theory of Computing, ISSN 1557-2862, Vol. 3, 211-219 p.Article in journal (Refereed) Published
Abstract [en]

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.
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:kth:diva-62995DOI: 10.4086/toc.2007.v003a011OAI: oai:DiVA.org:kth-62995DiVA: diva2:481475
Note
QC 20120123Available from: 2012-01-21 Created: 2012-01-21 Last updated: 2018-01-12Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textTheory of Computing

Authority records BETA

Håstad, Johan

Search in DiVA

By author/editor
Håstad, Johan
By organisation
Theoretical Computer Science, TCS
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 48 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf