A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The complexity of finite-valued CSPs

2013
*
Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13
*

Let Γ be a set of rational-valued functions on a fixed finite domain; such a set is called a finite-valued constraint language. The valued constraint satisfaction problem, VCSP(Γ), is the problem of minimising a function given as a sum of functions from Γ. We establish a dichotomy theorem with respect to exact solvability for all finite-valued languages defined on domains of arbitrary finite size. We show that every core language Γ either admits a binary idempotent and symmetric fractional

doi:10.1145/2488608.2488697
dblp:conf/stoc/ThapperZ13
fatcat:cehsaawevza7thx3wo45wzomta