COCO 2001 Annual IEEE Conference on Computational Complexity
 |  |
Wall of Fame | Most Viewed COCO-2001 Paper
COCO
2001
Springer
13 years 9 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
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 |  | 161 | ||
| 2 | | 154 | ||
| 3 | | 149 | ||
| 4 | | 142 | ||
| 5 | | 135 | ||
| 6 | | 122 | ||
| 7 | | 108 | ||
| 8 | | 107 | ||
| 9 | | 106 | ||
| 10 | | 104 | ||
| 11 | | 102 | ||
| 12 | | 102 | ||
| 13 | | 101 | ||
| 14 | | 94 |