Information Complexity and Applications

publicat: 5 set. 2017  |  
521visits
No s'ha trobat cap mèdia.
Sinopsis
Compartir
Descarregar
Comentaris (0)
  • Over the past two decades, information theory has reemerged within computational complexity theory as a mathematical tool for obtaining unconditional lower bounds in a number of models, including streaming algorithms, data structures, and communication complexity. Many of these applications can be systematized and extended via the study of information complexity – which treats information revealed or transmitted as the resource to be conserved.

    In this talk we will discuss the two-party information complexity and its properties – and the interactive analogues of classical source coding theorems. We will then discuss applications to exact communication complexity bounds, multi-party communication, and quantum communication complexity.

    Presentation by: Mark Braverman. Princeton University and Institute for Advanced Study, USA.

    Llicència Creative Commons by-nc-nd
    Notificar
    Alerta de contingut erroniTancar
    Si heu detectat algún error a aquest vídeo ens ho podeu notificar al correu mencionant l'identificador del vídeo: 115201
    ©Universitat de Barcelona
  • Codi per incrustar aquest vídeo
  • Per descarregar els fitxers cal que facis "Botó dret" sobre l'enllaç i "Desar enllaç com".
Pàgina