Correlation in hard distributions in communication complexity
We study the effect that the amount of correlation in a bipartite distribution has on the communication complexity of a problem under that distribution. We introduce a new family of complexity measures that interpolates between the two previously studied extreme cases: the (standard) randomised comm...
Saved in:
Main Authors: | Klauck, Hartmut, Bottesch, Ralph Christian, Gavinsky, Dmitry |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/87921 http://hdl.handle.net/10220/46886 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
The complexity of quantum disjointness
by: Klauck, Hartmut
Published: (2018) -
New bounds for the garden-hose model
by: Klauck, Hartmut, et al.
Published: (2018) -
Contributions to the study of probabilistic communication complexity classes
by: Bottesch, Ralph Christian
Published: (2016) -
The partition bound for classical communication complexity and query complexity
by: Jain, R., et al.
Published: (2013) -
EXPLORING DIFFERENT MODELS OF QUERY COMPLEXITY AND COMMUNICATION COMPLEXITY
by: SUPARTHA PODDER
Published: (2016)