Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics

03/25/2021
by   Jan Grebík, et al.
0

We classify which local problems with inputs on oriented paths have so-called Borel solution and show that this class of problems remains the same if we instead require a measurable solution, a factor of iid solution, or a solution with the property of Baire. Together with the work from the field of distributed computing [Balliu et al. PODC 2019], the work from the field of descriptive combinatorics [Gao et al. arXiv:1803.03872, Bernshteyn arXiv:2004.04905] and the work from the field of random processes [Holroyd et al. Annals of Prob. 2017, Grebík, Rozhoň arXiv:2103.08394], this finishes the classification of local problems with inputs on oriented paths using complexity classes from these three fields. A simple picture emerges: there are four classes of local problems and most classes have natural definitions in all three fields. Moreover, we now know that randomness does not help with solving local problems on oriented paths.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2018

Improving the Florentine algorithms: recovering algorithms for Motzkin and Schröder paths

We present random sampling procedures for Motzkin and Schröder paths, fo...
research
11/06/2017

New Classes of Distributed Time Complexity

A number of recent papers -- e.g. Brandt et al. (STOC 2016), Chang et al...
research
03/15/2021

Of Toasts and Tails

We present an intimate connection among the following fields: (a) dist...
research
05/02/2019

Alternative Techniques for Mapping Paths to HLAI

The only systematic mapping of the HLAI technical landscape was conducte...
research
02/28/2020

DROCC: Deep Robust One-Class Classification

Classical approaches for one-class problems such as one-class SVM (Schol...
research
06/09/2023

Towards Universally Optimal Shortest Paths Algorithms in the Hybrid Model

A drawback of the classic approach for complexity analysis of distribute...
research
01/23/2022

On the Homomorphism Order of Oriented Paths and Trees

A partial order is universal if it contains every countable partial orde...

Please sign up or login with your details

Forgot password? Click here to reset