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

论额头数字协议中的多路复用能力

On the Power of Multiplexing in Number-on-the-Forehead Protocols

Eldar Aharoni, Eyal Kushilevitz

摘要:

研究了$k$ -方“前额上的数字”(NOF)确定性通信复杂性的直和问题.我们证明了几个积极的结果,表明在这个模型中计算函数$f$的复杂性,在$\ell$的情况下,可能是显着便宜的$\ell$倍的复杂性计算$f$在一个单一的实例。令人惊讶的是,我们证明了这是“most”(布尔,$k$ -参数)函数的情况。然后,我们正式两种类型的NOF协议$Q$的充分条件,对于一个单一的实例,其中每一个保证一些通信复杂性节省时,适当地扩展$Q$工作在$\ell$实例。一个这样的条件指的是每一方需要知道关于其他方的输入的什么,另外,另一个条件指的是单实例协议$Q$使用的通信模式。在这两种情况下,我们使用的工具是“多路复用”:我们将单个实例的协议并行执行中发送的消息合并为多实例(直接和)情况下的单个消息,通过将它们彼此异或。

英文摘要:

We study the direct-sum problem for $k$-party ``Number On the Forehead'' (NOF) deterministic communication complexity. We prove several positive results, showing that the complexity of computing a function $f$ in this model, on $\ell$ instances, may be significantly cheaper than $\ell$ times the complexity of computing $f$ on a single instance. Quite surprisingly, we show that this is the case for ``most'' (boolean, $k$-argument) functions. We then formalize two-types of sufficient conditions on a NOF protocol $Q$, for a single instance, each of which guarantees some communication complexity savings when appropriately extending $Q$ to work on $\ell$ instances. One such condition refers to what each party needs to know about inputs of the other parties, and the other condition, additionally, refers to the communication pattern that the single-instance protocol $Q$ uses. In both cases, the tool that we use is ``multiplexing'': we combine messages sent in parallel executions of protocols for a single instance, into a single message for the multi-instance (direct-sum) case, by xoring them with each other.

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

↑