The Complexity of Valued Constraint Satisfaction

Peter Jeavons, Andrei Krokhin, Stanislav Živný · Durham Research Online (Durham University) · 2014

We survey recent results on the broad family of problems that can be cast as valued constraint satisfaction problems. We discuss general methods for analysing the complexity of such problems, give examples of tractable cases, and identify general features of the complexity landscape. 1

Read the paper · More papers on PaperTik