To refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1cw93Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Braverman, Mark | - |
| dc.date.accessioned | 2018-07-20T15:09:20Z | - |
| dc.date.available | 2018-07-20T15:09:20Z | - |
| dc.date.issued | 2013-10-2 | en_US |
| dc.identifier.citation | Braverman, M. (2013). A hard-to-compress interactive task?. 8 - 12. doi:10.1109/Allerton.2013.6736498 | en_US |
| dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr1cw93 | - |
| dc.description.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. | en_US |
| dc.format.extent | 8 - 12 | en_US |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartof | 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013 | en_US |
| dc.rights | Author's manuscript | en_US |
| dc.title | A hard-to-compress interactive task? | en_US |
| dc.type | Conference Article | en_US |
| dc.identifier.doi | doi:10.1109/Allerton.2013.6736498 | - |
| dc.date.eissued | 2014-02-13 | en_US |
| pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceeding | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| A hard-to-compress interactive task.pdf | 142.73 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.