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

人口协议状态复杂度的下界

Lower Bounds on the State Complexity of Population Protocols

Philipp Czerner, Javier Esparza, Jérôme Leroux

摘要:

人口协议是一种计算模型,其中任意数量的不可区分的有限状态代理人成对交互。代理的目标是通过稳定的共识来决定其初始全局配置是否满足给定的属性,指定为配置集上的谓词。一个谓词的状态复杂度是计算它的最小协议的状态数。Blondin \textit{et al.}以前的工作已经表明,计数谓词$x \geq η$对于无领导协议具有状态复杂度$\mathcal{O}(\log η)$,对于有领导协议具有状态复杂度$\mathcal{O}(\log \log η)$。我们得到了第一个非平凡的下界:$x \geq η$的状态复杂度是$Ω(\log\log η)$的无领导者的协议,和一个非初等函数的逆领导者的协议。

英文摘要:

Population protocols are a model of computation in which an arbitrary number of indistinguishable finite-state agents interact in pairs. The goal of the agents is to decide by stable consensus whether their initial global configuration satisfies a given property, specified as a predicate on the set of configurations. The state complexity of a predicate is the number of states of a smallest protocol that computes it. Previous work by Blondin \textit{et al.} has shown that the counting predicates $x \geq η$ have state complexity $\mathcal{O}(\log η)$ for leaderless protocols and $\mathcal{O}(\log \log η)$ for protocols with leaders. We obtain the first non-trivial lower bounds: the state complexity of $x \geq η$ is $Ω(\log\log η)$ for leaderless protocols, and the inverse of a non-elementary function for protocols with leaders.

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

↑