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

组合函数的同时多方通信复杂性

Simultaneous Multiparty Communication Complexity of Composed Functions

Yassine Hamoudi

摘要:

在额上数字(NOF)多方通信模型中,$k$参与者希望通过根据预定协议广播比特来评估某个输入$(x_1,\dots,x_k)$上的函数$F : X_1 \times\cdots\times X_k\rightarrow Y$。输入以这样一种方式分布,即每个参与者$i$都能看到除$x_i$之外的所有输入。在同步设置中,玩家不能互相说话,而是向裁判发送信息。裁判不知道球员的输入,也不能给出任何信息。最后,裁判必须能够从她获得的东西中恢复$F(x_1,\dots,x_k)$。一个被称为$\log n$障碍的中心开放问题是在同时NOF模型中找到一个对于$polylog(n)$或多个参与者(其中$x_i$的大小为$poly(n)$)难以计算的函数。这在电路复杂性方面有重要的应用,因为它可以帮助将$ACC^0$与其他复杂性类别分开。其中一个候选函数属于组合函数族。这些函数的输入由$k\times (t\cdot n)$布尔矩阵$M$表示,其行$i$是输入$x_i$,$t$是块宽度参数。作用于$M$的对称组合函数由两个对称的$n$变量函数$f$和$kt$变量函数$g$指定,它们输出$f\circ g(M)=f(g(B_1),\dots,g(B_n))$,其中$B_j$是$M$的宽度为$t$的第$j$个块。由于大多数函数$MAJ$被证明在$ACC^0$之外,Babai et.建议研究$MAJ\circ MAJ_t$,$t$足够大。到目前为止,人们只知道$t=1$是不够的$MAJ\circ MAJ_t$打破$\log n$障碍的同时确定性NOF模型。在本文中,我们将这一结果推广到任何恒定的块宽度$t>1$,通过给出一个协议的成本$2^{O(2^t)}\log^{2^{t+1}}(n)$的任何对称的组合函数时,有$2^{Ω(2^t)}\log n$播放器。

英文摘要:

In the Number On the Forehead (NOF) multiparty communication model, $k$ players want to evaluate a function $F : X_1 \times\cdots\times X_k\rightarrow Y$ on some input $(x_1,\dots,x_k)$ by broadcasting bits according to a predetermined protocol. The input is distributed in such a way that each player $i$ sees all of it except $x_i$. In the simultaneous setting, the players cannot speak to each other but instead send information to a referee. The referee does not know the players' input, and cannot give any information back. At the end, the referee must be able to recover $F(x_1,\dots,x_k)$ from what she obtained. A central open question, called the $\log n$ barrier, is to find a function which is hard to compute for $polylog(n)$ or more players (where the $x_i$'s have size $poly(n)$) in the simultaneous NOF model. This has important applications in circuit complexity, as it could help to separate $ACC^0$ from other complexity classes. One of the candidates belongs to the family of composed functions. The input to these functions is represented by a $k\times (t\cdot n)$ boolean matrix $M$, whose row $i$ is the input $x_i$ and $t$ is a block-width parameter. A symmetric composed function acting on $M$ is specified by two symmetric $n$- and $kt$-variate functions $f$ and $g$, that output $f\circ g(M)=f(g(B_1),\dots,g(B_n))$ where $B_j$ is the $j$-th block of width $t$ of $M$. As the majority function $MAJ$ is conjectured to be outside of $ACC^0$, Babai et. al. suggested to study $MAJ\circ MAJ_t$, with $t$ large enough. So far, it was only known that $t=1$ is not enough for $MAJ\circ MAJ_t$ to break the $\log n$ barrier in the simultaneous deterministic NOF model. In this paper, we extend this result to any constant block-width $t>1$, by giving a protocol of cost $2^{O(2^t)}\log^{2^{t+1}}(n)$ for any symmetric composed function when there are $2^{Ω(2^t)}\log n$ players.

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

↑