Simplified Separation of Information and Communication.
Anup Rao, Makrand Sinha · Electronic colloquium on computational complexity · 2015
We give an example of a boolean function whose information complexity is exponentially smaller than its communication complexity. Our result simplifies recent work of Ganor, Kol and Raz [GKR14a, GKR14b].