Reduction for Information Theory
Reduction arguments, long a mainstay of the computation theory literature, provide powerful tools for proving information theoretic results. In computation theory, reduction is used to relate solutions to distinct problems in order to compare their respective complexities. In information theory, reduction can be used to relate solutions to distinct network communication problems in order to compare their respective capacities. This talk will highlight both the technique and some examples of its application.