Simplified Separation of Information and Communication

@article{Rao2015SimplifiedSO,
  title={Simplified Separation of Information and Communication},
  author={Anup Rao and Makrand Sinha},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2015},
  volume={22},
  pages={57}
}
We give an example of a boolean function whose information complexity is exponentially smaller than its communication complexity. This was first proven recently by Ganor, Kol and Raz [15] and our work gives a simpler proof of the same result. In the course of this simplification, we make several new contributions: we introduce a new communication lower bound technique, the notion of a fooling distribution, which allows us to separate information and communication complexity, and we also give a… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 31 references

McAllester , and Jaikumar Radhakrishnan . The Communication Complexity of Correlation

  • Prahladh Harsha, Rahul Jain, A David
  • IEEE Transactions on Information Theory
  • 2016

On the Communication Complexity of Greater- Than

  • Makrand Sinha
  • In 53rd Annual Allerton Conference on…
  • 2015
1 Excerpt

Similar Papers

Loading similar papers…