Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #2 to TR15-057 | 14th April 2015 03:12

Simplified Separation of Information and Communication

RSS-Feed




Revision #2
Authors: Anup Rao, Makrand Sinha
Accepted on: 14th April 2015 03:12
Downloads: 543
Keywords: 


Abstract:

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 (FOCS'14, STOC'15).



Changes to previous version:

Fixed a typo concerning the indices in the proof.


Revision #1 to TR15-057 | 13th April 2015 17:46

Simplified Separation of Information and Communication





Revision #1
Authors: Anup Rao, Makrand Sinha
Accepted on: 13th April 2015 17:46
Downloads: 387
Keywords: 


Abstract:

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 (FOCS'14, STOC'15).



Changes to previous version:

Fixed an error in the previous definition of the distribution.


Paper:

TR15-057 | 13th April 2015 08:15

Simplified Separation of Information and Communication





TR15-057
Authors: Anup Rao, Makrand Sinha
Publication: 13th April 2015 09:21
Downloads: 872
Keywords: 


Abstract:

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 (FOCS'14, STOC'15).



ISSN 1433-8092 | Imprint