19 search results - page 1 / 4 » Graph Homomorphisms with Complex Values: A Dichotomy Theorem |
ICALP
2010
Springer
14 years 6 days ago
2010
Springer
STACS
2010
Springer
14 years 16 days ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
AAIM
2008
Springer
14 years 1 months ago
2008
Springer
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...