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

关于通信复杂性中一个问题的注记

A note on a problem in communication complexity

Henning Wunderlich

AI总结:

本研究针对结构通信复杂性中的有界误差随机化与多数算子,将Tarui定理转化为通信复杂性形式,明确弱无界误差通信的有界误差闭包与对数边际复杂度的分布扰动的对应关系,还定义了满足特定条件的多数算子并给出相关应用。

摘要:

我们研究结构通信复杂性中的有界误差随机化与多数算子。给出Tarui定理的通信复杂性形式,并明确弱无界误差通信的有界误差闭包与对数边际复杂度的分布扰动的对应关系。在Tarui的概率多项式中保留布尔保证可得到更强的包含关系$\mathsf{PH}^{\mathrm{cc}} \subseteq \mathsf{ZP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}} \subseteq \mathsf{BP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}}$。还定义了满足$\mathsf{PP}\mathbin{\cdot} \mathsf{P}^{\mathrm{cc}} = \mathsf{PP}^{\mathrm{cc}}$的多数算子,并利用Sasaki的多数公式证明$\mathord{\oplus}\mathsf{P}^{\mathrm{cc}} \subseteq \mathsf{PP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}}$。对于二元内积函数,外索引及每个内部协议的代价均为对数级。结合Forster的下界,这为多数算子的非幂等性及$\mathsf{PP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}} \not\subseteq \mathsf{UPP}^{\mathrm{cc}}$提供了显式例证。有界误差闭包与两级多数类均包含于$\mathsf{PSPACE}^{\mathrm{cc}}$。

英文摘要:

We study bounded-error randomization and majority operators in structural communication complexity. We give a communication-complexity formulation of Tarui's theorem and identify the bounded-error closure of weakly unbounded-error communication with a distributional perturbation of logarithmic margin complexity. Retaining the Boolean guarantee in Tarui's probabilistic polynomials yields the stronger inclusion $\mathsf{PH}^{\mathrm{cc}} \subseteq \mathsf{ZP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}} \subseteq \mathsf{BP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}}$. We also define a majority operator satisfying $\mathsf{PP}\mathbin{\cdot} \mathsf{P}^{\mathrm{cc}} = \mathsf{PP}^{\mathrm{cc}}$ and use Sasaki's majority formula to prove that $\mathord{\oplus}\mathsf{P}^{\mathrm{cc}} \subseteq \mathsf{PP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}}$. For the inner-product function modulo two, both the outer index and each inner protocol have logarithmic cost. Together with Forster's lower bound, this gives an explicit witness to the non-idempotence of the majority operator and to $\mathsf{PP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}} \not\subseteq \mathsf{UPP}^{\mathrm{cc}}$. Both the bounded-error closure and the two-level majority class are contained in $\mathsf{PSPACE}^{\mathrm{cc}}$.

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

↑