DFU.Vol7.15301.113.pdf
- Filesize: 0.56 MB
- 23 pages
Document
Hybrid Tractable Classes of Constraint Problems
Authors
-
Part of:
Volume:
The Constraint Satisfaction Problem: Complexity and Approximability (DFU - Vol. 7)
Series: Dagstuhl Follow-Ups (DFU) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2017-02-21
Cite AsGet BibTex
Martin C. Cooper and Stanislav Zivny. Hybrid Tractable Classes of Constraint Problems. In The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Follow-Ups, Volume 7, pp. 113-135, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/DFU.Vol7.15301.113
https://doi.org/10.4230/DFU.Vol7.15301.113
Abstract
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.
Keywords
- Constraint satisfaction problems
- Optimisation
- Tractability
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads