Graph Homomorphisms and Universal Algebra (Course Math Ma 01)

Topics:

We will study the time complexity of finite domain constraint satisfaction problems (finite domain CSP) with a focus on finite directed graphs. Important notions introduced in the course are clones, polymorphims, primitive positive definablility, ...

Language:

The course is offered in English.

Schedule:

We will use the Manuel Bodirsky Notes. If you attend the course and want to recieve emails from me, then register in the Opal course or contact me under . Here is an open text document, where you can write anonymus feedback.