The Community for Technology Leaders
RSS Icon
Subscribe
Palm Springs, California USA
Oct. 22, 2011 to Oct. 25, 2011
ISBN: 978-0-7695-4571-4
pp: 748-757
ABSTRACT
We show how to efficiently simulate the sending of a message to a receiver who has partial information about the message, so that the expected number of bits communicated in the simulation is close to the amount of additional information that the message reveals to the receiver who has some information about the message. This is a generalization and strengthening of the Slepian Wolf theorem, which shows how to carry out such a simulation with low amortized communication in the case that the message is a deterministic function of an input. A caveat is that our simulation is interactive. As a consequence, we prove that the internal information cost(namely the information revealed to the parties) involved in computing any relation or function using a two party interactive protocol is exactly equal to the amortized communication complexity of computing independent copies of the same relation or function. We also show that the only way to prove a strong direct sum theorem for randomized communication complexity is by solving a particular variant of the pointer jumping problem that we define. Our work implies that a strong direct sum theorem for communication complexity holds if and only if efficient compression of communication protocols is possible.
INDEX TERMS
Compression, Direct Sum, Communication Complexity
CITATION
Mark Braverman, Anup Rao, "Information Equals Amortized Communication", FOCS, 2011, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2011, pp. 748-757, doi:10.1109/FOCS.2011.86
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool