The Complexity of Valued CSPs

@inproceedings{Krokhin2017TheCO,
  title={The Complexity of Valued CSPs},
  author={Andrei A. Krokhin and Stanislav Zivny},
  booktitle={The Constraint Satisfaction Problem},
  year={2017}
}
  • Andrei A. Krokhin, Stanislav Zivny
  • Published in
    The Constraint Satisfaction…
    2017
  • Computer Science
  • We survey recent results on the broad family of problems that can be cast as valued constraint satisfaction problems (VCSPs). We discuss general methods for analysing the complexity of such problems, give examples of tractable cases, and identify general features of the complexity landscape. 1998 ACM Subject Classification F.1.3 Complexity Measures and Classes, G.1.6 Optimization 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 112 REFERENCES