Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

The complexity of valued constraint satisfaction.

Jeavons, P. and Krokhin, A. and Živný, S. (2014) 'The complexity of valued constraint satisfaction.', Bulletin of the EATCS., 113 . pp. 21-55.

Abstract

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.

Item Type:Article
Full text:(VoR) Version of Record
Download PDF
(309Kb)
Status:Not peer-reviewed
Publisher Web site:http://bulletin.eatcs.org/index.php/beatcs/article/view/266
Date accepted:No date available
Date deposited:20 October 2014
Date of first online publication:June 2014
Date first made open access:No date available

Save or Share this output

Export:
Export
Look up in GoogleScholar