CSDL Home F FOCS 2011 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011)
Palm Springs, CA
Oct. 22, 2011 to Oct. 25, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2011.86
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.
Compression, Direct Sum, Communication Complexity
Mark Braverman, Anup Rao, "Information Equals Amortized Communication", FOCS, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011), 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011) 2011, pp. 748-757, doi:10.1109/FOCS.2011.86