6 citations · 6 across the 4 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013
Computational Complexity of the Minimum Cost Homomorphism Problem on Three-Element Domains
Hannes Uppman
In this paper we study the computational complexity of the (extended) minimum cost homomorphism problem (Min-Cost-Hom) as a function of a constraint language, i.e. a set of constra…
cs.CC2013
Three-Element Min-Sol and Conservative Min-Cost-Hom
Hannes Uppman
Thapper and Zivny [STOC'13] recently classified the complexity of VCSP for all finite-valued constraint languages. However, the complexity of VCSPs for constraint languages that ar…