流通信协议
Streaming Communication Protocols
摘要：
我们定义了流通信模型，结合了通信复杂性和流的主要方面。我们考虑两个代理，要计算一些功能，依赖于输入，分发给每个代理。输入以数据流的形式到达，每个代理都有一个有限的内存。允许代理相互通信，并根据它们读取的输入位和它们收到的前一条消息更新它们的内存。我们提供了严格的权衡之间的必要的资源，即通信和内存，从通信复杂性的一些典型的问题，通过证明一个强大的一般下界技术。其次，我们分析了近似匹配问题，并表明，这个问题的复杂性（即可实现的近似比）在我们的模型的单向变量是严格不同的流复杂性和单向通信复杂性。
英文摘要：
We define the Streaming Communication model that combines the main aspects of communication complexity and streaming. We consider two agents that want to compute some function that depends on inputs that are distributed to each agent. The inputs arrive as data streams and each agent has a bounded memory. Agents are allowed to communicate with each other and also update their memory based on the input bit they read and the previous message they received. We provide tight tradeoffs between the necessary resources, i.e. communication and memory, for some of the canonical problems from communication complexity by proving a strong general lower bound technique. Second, we analyze the Approximate Matching problem and show that the complexity of this problem (i.e. the achievable approximation ratio) in the one-way variant of our model is strictly different both from the streaming complexity and the one-way communication complexity thereof.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
