Descriptive Complexity for Distributed Computing with Circuits
Lists
Only you see this
Abstract
We consider distributed algorithms in the realistic scenario where distributed message passing is operated by circuits. We show that within this setting, modal substitution calculus MSC precisely captures the expressive power of circuits. The result is established via constructing translations that are highly efficient in relation to size. We also observe that the coloring algorithm based on Cole-Vishkin can be specified by logarithmic size programs (and thus also logarithmic size circuits) in the bounded-degree scenario.
BibTeX
@article{ahvonen2023descriptive,
author = {Veeti Ahvonen and Damian Heiman and Lauri Hella and Antti Kuusisto},
title = {{Descriptive Complexity for Distributed Computing with Circuits}},
journal = {J. Log. Comput.},
year = {2023},
}| Formula size game and model checking for modal substitution calculus | arXiv · 2025 |
| Graded modal logic and counting message passing automata | arXiv · 2024 |
| Brief Announcement: Distributed Derandomization Revisited | Disc · 2023 |
| A knowledge-based analysis of global function computation | Distributed Comput · 2010 |
| L-Recursion and a new Logic for Logarithmic Space | arXiv · 2012 |
| Stone Age Distributed Computing | arXiv · 2012 |