Notes on CSPs and Polymorphisms
Rings and Algebras
2025-05-27 v2 Computational Complexity
Discrete Mathematics
Logic in Computer Science
Logic
Abstract
These are notes from a multi-year learning seminar on the algebraic approach to Constraint Satisfaction Problems (CSPs). The main topics covered are the theory of algebraic structures with few subpowers, the theory of absorbing subalgebras and its applications to studying CSP templates which can be solved by local consistency methods, and the dichotomy theorem for conservative CSP templates. Subsections and appendices cover supplementary material.
Cite
@article{arxiv.2210.07383,
title = {Notes on CSPs and Polymorphisms},
author = {Zarathustra Brady},
journal= {arXiv preprint arXiv:2210.07383},
year = {2025}
}
Comments
506 pages