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
- Tractability Digital Object Identifier 10.4230/DFU.Vol7.15301.113
- G.1.6 Optimization phrases Constraint satisfaction problems
- F.1.3 Complexity Measures and Classes
- G.2.2 Graph Theory
- G.2.1 Combinatorics
- 1998 ACM Subject Classification F.4.1 Mathematical Logic
- Tractability
- Optimisation
- Constraint satisfaction problems
Domaines
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 |
|---|---|
| Licence |