COCO   2008 Annual IEEE Conference on Computational Complexity
Wall of Fame | Most Viewed COCO-2008 Paper
146views Algorithms» more  COCO 2008»
9 years 1 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
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 source146
2Download preprint from source129
3Download preprint from source118
4Download preprint from source108
5Download preprint from source100
6Download preprint from source97
7Download preprint from source95
8Download preprint from source93
9Download preprint from source91
10Download preprint from source91
11Download preprint from source90
12Download preprint from source88
13Download preprint from source88
14Download preprint from source86
15Download preprint from source86
16Download preprint from source84
17Download preprint from source81
18Download preprint from source79
19Download preprint from source79
20Download preprint from source79
21Download preprint from source74
22Download preprint from source74
23Download preprint from source72