Information complexity and applications

IF 1.8 3区数学 Q1 MATHEMATICS

Japanese Journal of Mathematics Pub Date : 2019-03-05 DOI:10.1007/s11537-018-1727-9

Mark Braverman

引用次数: 2

Abstract

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.

查看原文本刊更多论文

信息复杂性和应用

本文是2017年7月在京都大学举行的第19届高木讲座的讲义。我们对信息复杂性理论及其与通信复杂性的联系进行了高层次的概述。然后我们讨论了信息复杂性的一些基本性质，以及在直接和定理和精确通信边界中的应用。我们以一些开放的问题和方向结束。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Japanese Journal of Mathematics 数学-数学

CiteScore

3.90

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The official journal of the Mathematical Society of Japan, the Japanese Journal of Mathematics is devoted to authoritative research survey articles that will promote future progress in mathematics. It encourages advanced and clear expositions, giving new insights on topics of current interest from broad perspectives and/or reviewing all major developments in an important area over many years. An eminent international mathematics journal, the Japanese Journal of Mathematics has been published since 1924. It is an ideal resource for a wide range of mathematicians extending beyond a small circle of specialists. The official journal of the Mathematical Society of Japan. Devoted to authoritative research survey articles that will promote future progress in mathematics. Gives new insight on topics of current interest from broad perspectives and/or reviews all major developments in an important area over many years.