A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A hard-to-compress interactive task?
2013
2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Whether the information complexity of any interactive problem is close to its communication complexity is an important open problem. In this note we give an example of a sampling problem whose information and communication complexity we conjecture to be as much as exponentially far apart.
doi:10.1109/allerton.2013.6736498
dblp:conf/allerton/Braverman13
fatcat:42d743ck4zd4nhpy4kz5a4viqe