2000 character limit reached
Notes on CSPs and Polymorphisms (2210.07383v2)
Published 13 Oct 2022 in math.RA, cs.CC, cs.DM, cs.LO, and math.LO
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
