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

指针跳跃问题中折叠协议的总通信复杂性

On total communication complexity of collapsing protocols for pointer jumping problem

Michał Jastrzębski

摘要:

研究了多方指针跳跃问题($MPJ_k^n$)中折叠协议的总通信复杂性。Brody和Chakrabati在\cite{bc08}中证明,在这种设置中,其中一个参与者必须至少传递$n - 0.5\log{n}$位。Liang在\cite{liang}中已经证明了协议匹配最大复杂度的这个下限。然而,就总复杂度(所有参与者发送的比特数)而言,他的协议比普通协议表现得更差。他强调说,实现总的复杂性比琐碎的更好是不可能的。本文证明了这一猜想。也就是说,我们表明,对于一个折叠协议的$MPJ_k^n$,总的通信复杂性至少是$n-2$关闭之间的差距,总复杂性的$MPJ_k^n$在折叠设置的下限和上限。

英文摘要:

This paper focuses on bounding the total communication complexity of collapsing protocols for multiparty pointer jumping problem ($MPJ_k^n$). Brody and Chakrabati in \cite{bc08} proved that in such setting one of the players must communicate at least $n - 0.5\log{n}$ bits. Liang in \cite{liang} has shown protocol matching this lower bound on maximum complexity. His protocol, however, was behaving worse than the trivial one in terms of total complexity (number of bits sent by all players). He conjectured that achieving total complexity better then the trivial one is impossible. In this paper we prove this conjecture. Namely, we show that for a collapsing protocol for $MPJ_k^n$, the total communication complexity is at least $n-2$ which closes the gap between lower and upper bound for total complexity of $MPJ_k^n$ in collapsing setting.

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

↑