19 citations · 81 across the 20 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013
On the reduction of the CSP dichotomy conjecture to digraphs
Jakub Bulin, Dejan Delic, Marcel Jackson +1
It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a re…
math.CO2013
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…