Constraint Satisfaction Complexity, and Logic

Lecturer: Dr. Phokion Kolaits

Constraint satisfaction problems constitute a broad class of algorithmic problems that are ubiquitous in several different areas of computer science.