The Communication complexity of correlation
10.1109/TIT.2009.2034824
Saved in:
Main Authors: | Harsha, P., Jain, R., McAllester, D., Radhakrishnan, J. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/39040 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Optimal direct sum results for deterministic and randomized decision tree complexity
by: Jain, R., et al.
Published: (2013) -
New results in the simultaneous message passing model via information theoretic techniques
by: Jain, R., et al.
Published: (2013) -
A direct product theorem for the two-party bounded-round public-coin communication complexity
by: Jain, R., et al.
Published: (2013) -
Correlation in hard distributions in communication complexity
by: Klauck, Hartmut, et al.
Published: (2018) -
Multiplicative functions arising from the study of mutually unbiased bases
by: Chan Heng Huat, et al.
Published: (2022)