📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

The Complexity of Valued CSPs

First Author: A. Krokhin

Attributed to: Submodular optimization, lattice theory and maximum constraint satisfaction problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.4230/DFU.Vol7.15301.9

Publication URI: http://dx.doi.org/10.4230/DFU.Vol7.15301.9

Type: Book Chapter

Book Title: The Constraint Satisfaction Problem: Complexity and Approximability (2017)

Page Reference: 233--266