The topic of this workshop is the interplay between Universal Algebra and Computer Science, specifically the computational complexity of various algebraic conditions and the algebraic approach to the Constraint Satisfaction Problem (CSP). There will be a strong focus on problem sessions in addition to the invited and contributed talks.

List of open problems discussed during the workshop: [pdf][Github].