arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1107.2559cs.CC
收藏

现有数多方通信复杂性的下限,使其变得简单

Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy

Jeff M. Phillips, Elad Verbin, Qin Zhang

摘要:

在本文中,我们证明了随机多方通信复杂性的下限,无论是在\emph{blackboard model}(其中每个消息都写在黑板上的所有球员看到)和(主要)在\emph{message-passing model},其中消息发送到球员。我们介绍了一种新的技术证明这样的界限,称为\emph{symmetrization},这是自然的,直观的,往往易于使用。例如,对于每个$k$播放器获得长度为$n$的位向量的问题,目标是计算这些向量的坐标异或,我们证明了黑板模型中$Ω(nk)$的紧下界。对于相同的问题与AND而不是XOR,我们证明了一个下界的消息传递模型(假设$k \le n/3200$)和$Ω(n \log k)$在黑板模型中的大致$Ω(nk)$。我们还证明了按位多数的下界,图连接性问题,以及其他问题;该技术似乎适用于广泛的其他问题。我们所有的下界都允许随机通信协议具有双侧误差。我们还使用对称化技术来证明多方通信的几个直和式的结果。

英文摘要:

In this paper we prove lower bounds on randomized multiparty communication complexity, both in the \emph{blackboard model} (where each message is written on a blackboard for all players to see) and (mainly) in the \emph{message-passing model}, where messages are sent player-to-player. We introduce a new technique for proving such bounds, called \emph{symmetrization}, which is natural, intuitive, and often easy to use. For example, for the problem where each of $k$ players gets a bit-vector of length $n$, and the goal is to compute the coordinate-wise XOR of these vectors, we prove a tight lower bounds of $Ω(nk)$ in the blackboard model. For the same problem with AND instead of XOR, we prove a lower bounds of roughly $Ω(nk)$ in the message-passing model (assuming $k \le n/3200$) and $Ω(n \log k)$ in the blackboard model. We also prove lower bounds for bit-wise majority, for a graph-connectivity problem, and for other problems; the technique seems applicable to a wide range of other problems as well. All of our lower bounds allow randomized communication protocols with two-sided error. We also use the symmetrization technique to prove several direct-sum-like results for multiparty communication.

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

↑