CC 2010 Creativity and Cognition
 |  |
Wall of Fame | Most Viewed CC-2010 Paper
CC
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
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 |  | 282 | ||
| 2 | | 243 | ||
| 3 | | 190 | ||
| 4 | | 179 | ||
| 5 | | 172 | ||
| 6 | | 155 | ||
| 7 | | 150 | ||
| 8 | | 144 | ||
| 9 | | 141 | ||
| 10 | | 135 | ||
| 11 | | 120 | ||
| 12 | | 118 | ||
| 13 | | 117 | ||
| 14 | | 117 | ||
| 15 | | 112 | ||
| 16 | | 109 | ||
| 17 | | 108 |