Deterministic Distributed algorithms and Descriptive Combinatorics on \Delta-regular trees

MaRDI QIDQ6396957zbMATH OpenFDO

Authors Sebastian F. Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhoň, Zoltán Vidnyánszky

Publication date 20 April 2022

Abstract: We study complexity classes of local problems on regular trees from the perspective of distributed local algorithms and descriptive combinatorics. We show that, surprisingly, some deterministic local complexity classes from the hierarchy of distributed computing exactly coincide with well studied classes of problems in descriptive combinatorics. Namely, we show that a local problem admits a continuous solution if and only if it admits a local algorithm with local complexity $O(lo{g}^{\ast }n)$, and a Baire measurable solution if and only if it admits a local algorithm with local complexity $O(logn)$.

This page was built for publication: Deterministic Distributed algorithms and Descriptive Combinatorics on \Delta-regular trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6396957)