Sciweavers

Share
COCO   2001 Annual IEEE Conference on Computational Complexity
Wall of Fame | Most Viewed COCO-2001 Paper
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
10 years 10 days ago
Communication Complexity Lower Bounds by Polynomials
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...
Harry Buhrman, Ronald de Wolf
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.
IdReadViewsTitleStatus
1Download preprint from source161
2Download preprint from source154
3Download preprint from source149
4Download preprint from source142
5Download preprint from source135
6Download preprint from source122
7Download preprint from source108
8Download preprint from source107
9Download preprint from source106
10Download preprint from source104
11Download preprint from source102
12Download preprint from source102
13Download preprint from source101
14Download preprint from source94
books