arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1010.0522cs.CCcs.ITmath.IT
收藏

强直积猜想对公共硬币随机单向通信复杂性中所有关系成立

Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity

Rahul Jain

摘要:

设X x Y x Z的f子集是一个关系.让f的公共硬币单向通信复杂性,最坏情况误差为1/3,表示为R^{1,pub}_{1/3}(f)。我们证明了如果对于计算f^k(k个f的独立副本),提供o(k R^{1,pub}_{1/3}(f))通信,则成功在k中是指数小的。这解决了公共硬币单向通信复杂性中所有关系的强直积猜想。我们展示了公共硬币单向通信复杂性的新的紧密表征,其加强了[J.,Klauck,Nayak 08].我们使用新的表征,以显示我们的直接产品的结果,这也可能是独立的利益。

英文摘要:

Let f subset of X x Y x Z be a relation. Let the public coin one-way communication complexity of f, with worst case error 1/3, be denoted R^{1,pub}_{1/3}(f). We show that if for computing f^k (k independent copies of f), o(k R^{1,pub}_{1/3}(f)) communication is provided, then the success is exponentially small in k. This settles the strong direct product conjecture for all relations in public coin one-way communication complexity. We show a new tight characterization of public coin one-way communication complexity which strengthens on the tight characterization shown in [J., Klauck, Nayak 08]. We use the new characterization to show our direct product result and this may also be of independent interest.

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

↑