COCO   2003 Annual IEEE Conference on Computational Complexity
Wall of Fame | Most Viewed COCO-2003 Paper
162views Algorithms» more  COCO 2003»
9 years 3 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source162
2Download preprint from source145
3Download preprint from source135
4Download preprint from source118
5Download preprint from source114
6Download preprint from source102
7Download preprint from source98
8Download preprint from source93
9Download preprint from source93
10Download preprint from source91
11Download preprint from source88
12Download preprint from source87
13Download preprint from source85
14Download preprint from source84
15Download preprint from source82
16Download preprint from source64