图同态与普遍代数
Graph Homomorphisms and Universal Algebra
AI总结：
课程探讨有限域约束满足问题的计算复杂性，重点介绍循环项和有界宽度定理，以图同态问题为切入点，分析多项式时间可解与NP难之间的边界。
摘要：
约束满足问题是理论计算机科学中自然出现的计算问题之一。其计算复杂性是核心主题，特别是多项式时间可解性与NP难之间的边界。本课程介绍通用代数方法来研究有限域CSPs的计算复杂性。课程特别涵盖循环项和有界宽度定理。为了保持讲解的可访问性，我们从有向图和图同构问题的现实场景开始课程。
英文摘要：
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between polynomial-time tractability and NP-hardness. In this course we introduce the universal-algebraic approach to study the computational complexity of finite-domain CSPs. The course covers in particular the cyclic terms and bounded width theorems. To keep the presentation accessible, we start the course in the tangible setting of directed graphs and graph homomorphism problems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
