Separating complexity classes of LCL problems on grids
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913823456231424 |
|---|---|
| author | Berlow, Katalin Bernshteyn, Anton Lyons, Clark Weilacher, Felix |
| author_facet | Berlow, Katalin Bernshteyn, Anton Lyons, Clark Weilacher, Felix |
| contents | 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. Our results separate various complexity classes that were not previously known to be distinct and serve as counterexamples to a number of natural conjectures in the field. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_17445 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Separating complexity classes of LCL problems on grids Berlow, Katalin Bernshteyn, Anton Lyons, Clark Weilacher, Felix Logic Computational Complexity Combinatorics Probability 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. Our results separate various complexity classes that were not previously known to be distinct and serve as counterexamples to a number of natural conjectures in the field. |
| title | Separating complexity classes of LCL problems on grids |
| topic | Logic Computational Complexity Combinatorics Probability |
| url | https://arxiv.org/abs/2501.17445 |