z-logo
open-access-imgOpen Access
The Complexity of Valued Constraint Satisfaction Problems in a Nutshell
Author(s) -
Johan Thapper
Publication year - 2012
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - constraint satisfaction problem , computer science , constraint (computer aided design) , constraint satisfaction , complexity of constraint satisfaction , mathematical optimization , constraint satisfaction dual problem , theoretical computer science , computational complexity theory , local consistency , algorithm , mathematics , artificial intelligence , geometry , probabilistic logic

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom