COCO 2003 Annual IEEE Conference on Computational Complexity
 |  |
Wall of Fame | Most Viewed COCO-2003 Paper
COCO
2003
Springer
13 years 9 months ago
2003
Springer
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 ...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 162 | ||
| 2 | | 145 | ||
| 3 | | 135 | ||
| 4 | | 118 | ||
| 5 | | 114 | ||
| 6 | | 102 | ||
| 7 | | 98 | ||
| 8 | | 93 | ||
| 9 | | 93 | ||
| 10 | | 91 | ||
| 11 | | 88 | ||
| 12 | | 87 | ||
| 13 | | 85 | ||
| 14 | | 84 | ||
| 15 | | 82 | ||
| 16 | | 64 |