A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The Complexity of Constraint Satisfaction Problems *

*
licensed under Creative Commons License CC-BY 32nd Symposium on Theoretical Aspects of Computer Science (STACS 2015
*
unpublished

The tractability conjecture for constraint satisfaction problems (CSPs) describes the constraint languages over a finite domain whose CSP can be solved in polynomial-time. The precise formulation of the conjecture uses basic notions from universal algebra. In this talk, we give a short introduction to the universal-algebraic approach to the study of the complexity of CSPs. Finally, we discuss attempts to generalise the tractability conjecture to large classes of constraint languages over

fatcat:nw37mcxkb5g2xmxszh4q3fwfxm