#### Filter Results:

#### Publication Year

2013

2014

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

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)

For a digraph H, the Constraint Satisfaction Problem with template H, or CSP(H), is the problem of deciding whether a given input digraph G admits a homomorphism to H. The CSP dichotomy conjecture of Feder and Vardi states that for any digraph H, CSP(H) is either in P or NP-complete. Barto, Kozik, Maróti and Niven (Proc. Amer. Math. Soc, 2009) confirmed the… (More)

- Jakub Bulin
- ArXiv
- 2014

For a fixed digraph H, the H-coloring problem is the problem of deciding whether a given input digraph G admits a homomorphism to H. The CSP dichotomy conjecture of Feder and Vardi is equivalent to proving that, for any H, the H-coloring problem is in in P or NP-complete. We confirm this dichotomy for a certain class of oriented trees, which we call special… (More)

- ‹
- 1
- ›