This paper describes several cases of adjunction in the homomorphism ord...
A Datalog program can be viewed as a syntactic specification of a functo...
We study the use of local consistency methods as reductions between
cons...
The study of the complexity of the constraint satisfaction problem (CSP)...
The algebraic dichotomy conjecture for Constraint Satisfaction Problems
...
The approximate graph colouring problem concerns colouring a k-colourabl...
We study the complexity of approximation on satisfiable instances for gr...
The algebraic dichotomy conjecture for Constraint Satisfaction Problems
...
The algebraic dichotomy conjecture for Constraint Satisfaction Problems
...
This paper investigates the computational complexity of deciding if a gi...
The complexity and approximability of the constraint satisfaction proble...