信息复杂性与交互式压缩的探索（综述）
Information Complexity and the Quest for Interactive Compression (A Survey)
摘要：
信息复杂性是香农经典信息论的交互式模拟。近年来，这一领域已成为一个强大的工具，证明强通信下界，并解决了通信复杂性和电路复杂性的一些主要的开放问题。信息复杂性的一个显著成就是对基本直和与直积结构的理解的突破，其目的是量化并行计算的能力。本文简要介绍了信息复杂性的概念，综述了信息复杂性研究的最新进展及其与交互式协议压缩问题的密切关系。
英文摘要：
Information complexity is the interactive analogue of Shannon's classical information theory. In recent years this field has emerged as a powerful tool for proving strong communication lower bounds, and for addressing some of the major open problems in communication complexity and circuit complexity. A notable achievement of information complexity is the breakthrough in understanding of the fundamental direct sum and direct product conjectures, which aim to quantify the power of parallel computation. This survey provides a brief introduction to information complexity, and overviews some of the recent progress on these conjectures and their tight relationship with the fascinating problem of compressing interactive protocols.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
