| Instructors: | Manuel Bodirsky and Miki Hermann |
| Dates: | 25/11/2009 until 27/1/2010 |
| Time: | 8.45 am until 11.45 am |
| Classroom: | Not 1C18 as originally announced, but 5C03 until 09/12/09 (inclusive), and 8B01 starting from 16/12/09 |
This is the course website for the first part of the MPRI course 2-31-1 Constraint Satisfaction: Algorithms and Complexity.
The topic of this part of the course are graph homomorphism problems and constraint satisfaction problems with infinite domains, with a particular focus on constraint satisfaction problems that can be solved in polynomial time.
The web-site for the second part of the course can be found here.
Some of the topics of the course are illustrated by slides. The course slides will be available after they have been presented in the lecture.
A course script of a related course (covering also topics from the part of the lecture by Miki Herrman) held at ESSLLI 2007 is available as pdf file.
The students of the MPRI are highly welcome to do their MPRI research project on topics related to this course. Here are descriptions of research projects that can be persued. Other projects are possible.