Complexity and polymorphisms for digraph constraint problems under some basic constructions

Marcel Jackson, Tomasz Kowalski, Todd Niven

The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context we study the stability of CSP complexity and polymo…