@inproceedings{ab6ae7307c794e77909b0af780b09226,
title = "A hard-to-compress interactive task?",
abstract = "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.",
author = "Mark Braverman",
year = "2013",
doi = "10.1109/Allerton.2013.6736498",
language = "English (US)",
isbn = "9781479934096",
series = "2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013",
publisher = "IEEE Computer Society",
pages = "8--12",
booktitle = "2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013",
address = "United States",
note = "51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013 ; Conference date: 02-10-2013 Through 04-10-2013",
}