Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CC
2010
Springer

favoriteEmaildiscussreport

108views System Software» more CC 2010»

Communication Complexity Under Product and Nonproduct Distributions

13 years 5 months ago

Communication Complexity Under Product and Nonproduct Distributions

Download www.cs.toronto.edu

We solve an open problem in communication complexity posed by Kushilevitz and Nisan (1997). Let R (f) and D

Alexander A. Sherstov

Real-time Traffic

CC 2010 | Minimax Principle | System Software | Well-known Minimax Principle | µ-distributional Communication Complexities |

claim paper

Related Content

» A strong direct product theorem for twoway public coin communication complexity

» New bounds on classical and quantum oneway communication complexity

» New strong direct product results in communication complexity

» Production in a Multimodal Corpus how Speakers Communicate Complex Actions

» Managing Libre Software Distributions under a Product Line Approach

» Distributed Diagnosis Under BoundedDelay Communication of Immediately Forwarded Local Obse...

» Product theorems via semidefinite programming

» Group Communication Protocols under Errors

» Global Communication Optimization for Tensor Contraction Expressions under Memory Constrai...

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CC
Authors	Alexander A. Sherstov

Comments (0)