arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0805.2135cs.CC
收藏

利用对偶多项式的通信下界

Communication Lower Bounds Using Dual Polynomials

Alexander A. Sherstov

摘要:

布尔函数的实多项式表示在复杂性理论中起着重要的作用。通常,人们对多项式p(x_1,.,x_n),其近似或符号表示给定的布尔函数f(x_1,...,x_n)。本文综述了通信复杂性中一个新的和不断增长的工作主体,它围绕着双重对象,即,证明逼近或符号表示给定函数的难度的多项式。我们为以下结果提供了统一的指导,并完成了所有关键的证明:(1)Sherstov的度/离散定理,它将布尔函数的阈值度的下界转换为相关函数的差异的上界;(2)基于近似度证明有界错误通信下界的两种不同方法:(3)将Lee和Shraibman以及Chattopadhyay和Ada提出的模式矩阵方法推广到多方模型,并改进了离散性的下界;(4)David和Pitassi在多方通信复杂性中对k=(1-eps)log n局中人NP和BPP的分离。

英文摘要:

Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean function f(x_1,...,x_n). This article surveys a new and growing body of work in communication complexity that centers around the dual objects, i.e., polynomials that certify the difficulty of approximating or sign-representing a given function. We provide a unified guide to the following results, complete with all the key proofs: (1) Sherstov's Degree/Discrepancy Theorem, which translates lower bounds on the threshold degree of a Boolean function into upper bounds on the discrepancy of a related function; (2) Two different methods for proving lower bounds on bounded-error communication based on the approximate degree: Sherstov's pattern matrix method and Shi and Zhu's block composition method; (3) Extension of the pattern matrix method to the multiparty model, obtained by Lee and Shraibman and by Chattopadhyay and Ada, and the resulting improved lower bounds for DISJOINTNESS; (4) David and Pitassi's separation of NP and BPP in multiparty communication complexity for k=(1-eps)log n players.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑