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

实数上的概率通信复杂性

Probabilistic communication complexity over the reals

Dima Grigoriev

摘要:

确定性和概率通信协议中,各方可以交换多项式的值(而不是在通常的设置位)。建立了$2n$识别二维正交项的通信复杂性的一个精确下界,另一方面其识别的概率通信复杂性不超过4。在$\RR^{2n}$中构造了一个多面体和一个超平面的并集,证明了它们各自识别的概率通信复杂性的一个下界$n/2$。因此,这个界限也适用于EMPTOTH和KNAPSACK问题。

英文摘要:

Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting). It is established a sharp lower bound $2n$ on the communication complexity of recognizing the $2n$-dimensional orthant, on the other hand the probabilistic communication complexity of its recognizing does not exceed 4. A polyhedron and a union of hyperplanes are constructed in $\RR^{2n}$ for which a lower bound $n/2$ on the probabilistic communication complexity of recognizing each is proved. As a consequence this bound holds also for the EMPTINESS and the KNAPSACK problems.

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

↑