当前位置: X-MOL 学术arXiv.cs.CC › 论文详情
Message complexity of population protocols
arXiv - CS - Computational Complexity Pub Date : 2020-03-20 , DOI: arxiv-2003.09532
Talley Amir; James Aspnes; David Doty; Mahsa Eftekhari H.; Eric Severson

The standard population protocol model assumes that when two agents interact, each observes the entire state of the other agent. We initiate the study of the $\textbf{message complexity}$ for population protocols, where the state of an agent is divided into an externally-visible $\textbf{message}$ and an internal component, where only the message can be observed by the other agent in an interaction. We consider the case of $O(1)$ message complexity. When time is unrestricted, we obtain an exact characterization of the stably computable predicates based on the number of internal states $s(n)$: If $s(n) = o(n)$ then the protocol computes a semilinear predicate (unlike the original model, which can compute non-semilinear predicates with $s(n) = O(\log n)$), and otherwise it computes a predicate decidable by a nondeterministic $O(n \log s(n))$-space-bounded Turing machine. We then consider time complexity, introducing novel $O(\mathrm{polylog}(n))$ expected time protocols for junta/leader election and general purpose broadcast correct with high probability, and approximate and exact population size counting correct with probability 1. Finally, we show that the main constraint on the power of bounded-message-size protocols is the size of the internal states: with unbounded internal states, any computable function can be computed with probability 1 in the limit by a protocol that uses only one-bit messages.
更新日期:2020-03-24

 

全部期刊列表>>
智控未来
聚焦商业经济政治法律
跟Nature、Science文章学绘图
控制与机器人
招募海内外科研人才,上自然官网
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
湖南大学化学化工学院刘松
上海有机所
李旸
南方科技大学
西湖大学
伊利诺伊大学香槟分校
徐明华
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug