• DocumentCode
    3246706
  • Title

    A hard-to-compress interactive task?

  • Author

    Braverman, Mark

  • Author_Institution
    Dept. of Comput. Sci., Princeton Univ., Princeton, NJ, USA
  • fYear
    2013
  • fDate
    2-4 Oct. 2013
  • Firstpage
    8
  • Lastpage
    12
  • 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.
  • Keywords
    communication complexity; sampling methods; communication complexity; hard-to-compress interactive task; information complexity; interactive problem; sampling problem; Complexity theory; Computer science; Context; Educational institutions; Indexes; Protocols; Source coding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication, Control, and Computing (Allerton), 2013 51st Annual Allerton Conference on
  • Conference_Location
    Monticello, IL
  • Print_ISBN
    978-1-4799-3409-6
  • Type

    conf

  • DOI
    10.1109/Allerton.2013.6736498
  • Filename
    6736498
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3246706