6 citations · 12 across the 16 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.LO2022★ 2 cited
Computable vs Descriptive Combinatorics of Local Problems on Trees
Felix Weilacher
We study the position of the computable setting in the "common theory of locality" developed in arXiv:2106.02066 and arXiv:2204.09329 for local problems on -regular trees, $Δ\in…
math.LO2022★ 2 cited
Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms
Long Qian, Felix Weilacher
We introduce new types of local algorithms, which we call "ASI Algorithms", and use them to demonstrate a link between descriptive and computable combinatorics. This allows us to u…