A Topological Characterization to Arbitrary Resilient Asynchronous Complexity

A Topological Characterization to Arbitrary Resilient Asynchronous Complexity

In this work, we extend the topology-based framework and method for the quantification and classification of general resilient asynchronous complexity. We present the <i>arbitrary resilient asynchronous complexity theorem</i>, applied to decision tasks in an iterated delayed model which...

Full description

Bibliographic Details
Main Authors: Yunguang Yue, Xingwu Liu, Fengchun Lei, Jie Wu
Format: Article
Language:English
Published: MDPI AG 2022-08-01
Series:Mathematics
Subjects:
distributed computation
asynchronous computation
combinatorial topology
computability
complexity
resilience
Online Access:https://www.mdpi.com/2227-7390/10/15/2720

Internet

https://www.mdpi.com/2227-7390/10/15/2720

Similar Items