AI Chat AI Image Generator AI Video Text to Speech

Notes on CSPs and Polymorphisms

10/13/2022

∙

by Zarathustra Brady, et al.

∙

∙

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.

research

∙ 09/25/2017

A new algorithm for constraint satisfaction problems with Maltsev templates

In this article, we provide a new algorithm for solving constraint satis...

0 Dejan Delic, et al. ∙

research

∙ 04/23/2021

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP

This paper focuses on the algebraic theory underlying the study of the c...

0 Libor Barto, et al. ∙

research

∙ 08/28/2019

Lecture Notes: Selected topics on robust statistical learning theory

These notes gather recent results on robust statistical learning theory....

0 Matthieu Lerasle, et al. ∙

research

∙ 12/10/2020

Notes on Deep Learning Theory

These are the notes for the lectures that I was giving during Fall 2020 ...

0 Eugene. A. Golikov, et al. ∙

research

∙ 02/17/2020

When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems

We produce a class of ω-categorical structures with finite signature by ...

0 Pierre Gillibert, et al. ∙

research

∙ 09/02/2022

Category Theory for Programming

In these lecture notes, we give a brief introduction to some elements of...

0 Benedikt Ahrens, et al. ∙

research

∙ 03/09/2023

π-augmented pregroups and applications to linguistics

We enrich pregroups with a mapping which allows us to locally apply prec...

0 Valentin Boboc, et al. ∙