三元最小解与保守最小费用折
Three-Element Min-Sol and Conservative Min-Cost-Hom
摘要:
Thapper和Zivny [STOC'13]最近对所有有限值约束语言的VCSP的复杂性进行了分类。然而,对于非有限值约束语言的VCSP的复杂性仍然知之甚少。在本文中,我们研究了两个这样的VCSP的复杂性,即最小成本-霍姆和最小溶胶。我们得到了一个完整的分类的复杂性Min-Sol的域,包含最多三个元素和保守的Min-Cost-Hom的复杂性在任意有限域。我们的结果回答了Takhanov提出的一个问题[STACS'10,COCOON'10]。
英文摘要:
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 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].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。