Separating complexity classes of LCL problems on grids

Katalin Berlow, Anton Bernshteyn, Clark Lyons +1

We study the complexity of locally checkable labeling (LCL) problems on ${\mathbb{Z}}^n$ from the point of view of descriptive set theory, computability theory, and factors of i.i.d.…