Answers are grounded in this paper and cite their sources.
This paper is a lecture note accompanying the 19th Takagi Lectures lectures in July 2017 at Kyoto University. We give a high-level overview of information complexity theory and its connections to communication complexity.We then discuss some fundamental properties of information complexity, and applications to direct sum theorems and to exact communication bounds. We conclude with some open questions and directions.
No takes yet. Share an insight, caveat, or question.
Mark Braverman (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: