CC   2010 Creativity and Cognition
Wall of Fame | Most Viewed CC-2010 Paper
282views System Software» more  CC 2010»
10 years 10 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
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...
Nikos Leonardos, Michael Saks
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 source282
2Download preprint from source243
3Download preprint from source190
4Download preprint from source179
5Download preprint from source172
6Download preprint from source155
7Download preprint from source150
8Download preprint from source144
9Download preprint from source141
10Download preprint from source135
11Download preprint from source120
12Download preprint from source118
13Download preprint from source117
14Download preprint from source117
15Download preprint from source112
16Download preprint from source109
17Download preprint from source108