Graph Homomorphisms and Universal Algebra (Modul Math Ma 35)
Topics:
We will study the time complexity of finite domain constraint satisfaction problems (finite domain CSP) and the connections of the CSP to some universal algebraic notions such as clones, polymorphisms, varieties, equational theories, etc.
Language:
The course is offered in English.
Schedule:
| Mo | Start: 16:40 | End: 18:10 | WIL/A120 |
| Fr | Start: 11:10 | End: 12:40 | Z21/217 |
We will use the Manuel Bodirsky Notes
| Date | Summary |
| 07.04 | Intro lecture. We defined a CSP, a relational structure, homomorphism, finite domain CSP, CSP with restricted template, and polymorphism. Next time we will cover material from sections 2.1-2.4 of the Bodirsky notes. |