Hybrid Tractable Classes of Constraint Problems
Résumé
We present a survey of complexity results for hybrid constraint satisfaction problems (CSPs) and valued constraint satisfaction problems (VCSPs). These are classes of (V)CSPs defined by restrictions that are not exclusively language-based or structure-based.
Mots clés
Constraint satisfaction problems
Optimisation
Tractability
1998 ACM Subject Classification F.4.1 Mathematical Logic
G.2.1 Combinatorics
G.2.2 Graph Theory
F.1.3 Complexity Measures and Classes
G.1.6 Optimization phrases Constraint satisfaction problems
Tractability Digital Object Identifier 10.4230/DFU.Vol7.15301.113
Domaines
Informatique [cs]
Fichier principal
Hybrid Tractable Classes of Constraint Problems.pdf (324.45 Ko)
Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte