Amortized Communication Complexity
SIAM Journal on Computing
Communication complexity
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The Communication Complexity of Correlation
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
A direct sum theorem in communication complexity via message compression
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
How to compress interactive communication
Proceedings of the forty-second ACM symposium on Theory of computing
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Information Equals Amortized Communication
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Interactive information complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
From information to exact communication
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We show that in the model of zero error communication complexity, direct sum fails for average communication complexity as well as for external information cost. Our example also refutes a version of a conjecture by Braverman et al. that in the zero error case amortized communication complexity equals external information cost. In our examples the underlying distributions do not have full support. One interpretation of a distributions of non full support is as a promise given to the players (the players have a guarantee on their inputs). This brings up the issue of promise versus non-promise problems in this context.