Abstract
Thapper and Živný [STOC'13] recently classified the complexity of VCSP for all finite-valued constraint languages. However, the complexity of VCSPs for constraint languages that are not finite-valued remains poorly understood. In this paper we study the complexity of two such VCSPs, namely Min-Cost-Hom and Min-Sol. We obtain a full classification for the complexity of Min-Sol on domains that contain at most three elements and for the complexity of conservative Min-Cost-Hom on arbitrary finite domains. Our results answer a question raised by Takhanov [STACS'10, COCOON'10]. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Uppman, H. (2013). The complexity of three-element Min-Sol and conservative Min-Cost-Hom. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7965 LNCS, pp. 804–815). https://doi.org/10.1007/978-3-642-39206-1_68
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
