Learn More
It is well known that the constraint satisfaction problem over a general re-lational structure A is polynomial time equivalent to the constraint problem over some associated digraph. We present a variant of this construction and show that the corresponding constraint satisfaction problem is logspace equivalent to that over A. Moreover, we show that almost(More)
It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to di-graphs. We present a simple variant of such a reduction and use it to show that the algebraic dichotomy conjecture is equivalent to its restriction to digraphs and that the polynomial reduction can be made in logspace. We also(More)
  • 1