DFU.Vol7.15301.79.pdf
- Filesize: 0.61 MB
- 33 pages
Document
Constraint Satisfaction Problems over Numeric Domains
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 As Get BibTex
Manuel Bodirsky and Marcello Mamino. Constraint Satisfaction Problems over Numeric Domains. In The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Follow-Ups, Volume 7, pp. 79-111, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/DFU.Vol7.15301.79
Abstract
We present a survey of complexity results for constraint satisfaction problems (CSPs) over the integers, the rationals, the reals, and the complex numbers. Examples of such problems are feasibility of linear programs, integer linear programming, the max-atoms problem, Hilbert's tenth problem, and many more. Our particular focus is to identify those CSPs that can be solved in polynomial time, and to distinguish them from CSPs that are NP-hard. A very helpful tool for obtaining complexity classifications in this context is the concept of a polymorphism from universal algebra.
Subject Classification
Keywords
- Constraint satisfaction problems
- Numerical domains
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads