Proof — Information complexity

Statement

Information theory for communication protocols; direct-sum theorems. Proved in ZFC.

Proof sketch

ZFC → information theory, protocols as functions. Information complexity bounds amortized communication. Direct-sum theorems.

Source

IMU Abacus Medal 2022. Information theory for communication protocols; direct-sum theorems. Proved in ZFC.

Domains

computer-science

People

Related

Explore

Canonical: https://axiom.tanaakk.com/proof/braverman-abacus-2022/