The goal of this seminar is to provide the students with an account of the most recent algebraic techniques used to classify the complexity of computational problems called Constraint Satisfactions Problems with infinite templates. Students will be prepared to conduct further research in the area at any level (master, PHD or postdoc).

The students prepare and present selected topics on the infinite domain CSPs.