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

具有对数空间的一致人口协议的表达能力

The Expressive Power of Uniform Population Protocols with Logarithmic Space

Philipp Czerner, Vincent Fischer, Roland Guttenberg

AI总结:

本文针对人口协议在Θ(log n)至Θ(polylog n)状态区间表达能力未知的空白,证明当状态数为Θ(f(n))且f∈Ω(log n)∩O(n^(1-ε))时,一致与非一致协议恰好能判定一元编码属于NSPACE(f(n)log n)的谓词。

摘要:

人口协议是一种计算模型,其中不可区分的移动智能体成对交互,以判定其初始配置的某种性质。该模型最初由Angluin等人在2004年提出,使用常数数量的状态,而当前研究则关注空间使用量依赖于智能体数量的协议。然而,迄今为止,人口协议的表达能力仅在状态数为$o(\log n)$(只能计算半线性谓词)以及状态数为$Ω(n)$的情况下得到确定。这留下了一个显著的空白,特别是对于状态数为$Θ(\log n)$或$Θ(\mathsf{polylog}~ n)$的协议,而这类协议是文献中最常见的构造。本文填补了这一空白,并证明对于任意$ε > 0$以及$f {\in}Ω(\log n) {\cap}O(n^{1-ε})$,具有$Θ(f(n))$个状态的一致和非一致人口协议恰好能够判定那些一元编码属于$\mathsf{NSPACE}(f(n) \log n)$的谓词。

英文摘要:

Population protocols are a model of computation in which indistinguishable mobile agents interact in pairs to decide a property of their initial configuration. Originally introduced by Angluin et. al. in 2004 with a constant number of states, research nowadays focuses on protocols where the space usage depends on the number of agents. The expressive power of population protocols has so far however only been determined for protocols using $o(\log n)$ states, which compute only semilinear predicates, and for $Ω(n)$ states. This leaves a significant gap, particularly concerning protocols with $Θ(\log n)$ or $Θ(\mathsf{polylog}~ n)$ states, which are the most common constructions in the literature. In this paper we close the gap and prove that for any $ε > 0$ and $f {\in}Ω(\log n) {\cap}O(n^{1-ε})$, both uniform and non-uniform population protocols with $Θ(f(n))$ states can decide exactly those predicates, whose unary encoding lies in $\mathsf{NSPACE}(f(n) \log n)$.

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

↑