R\'enyi Information Complexity and an Information Theoretic Characterization of the Partition Bound

DOI10.4230/LIPICS.ICALP.2016.88zbMath1388.68092arXiv1511.07949OpenAlexW2963013559MaRDI QIDQ4598228

Vinod M. Prabhakaran, Manoj Prabhakaran

Publication date: 19 December 2017

Full work available at URL: https://arxiv.org/abs/1511.07949

zbMATH Keywords

information complexitycommunication complexityRényi mutual information

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: R\'enyi Information Complexity and an Information Theoretic Characterization of the Partition Bound