Constraint Satisfaction Problems over Numeric Domains

Bodirsky, Manuel; Mamino, Marcello

doi:10.4230/DFU.Vol7.15301.79

Document

Constraint Satisfaction Problems over Numeric Domains

Authors Manuel Bodirsky, Marcello Mamino

Part of: Volume: The Constraint Satisfaction Problem: Complexity and Approximability (DFU - Vol. 7)
Part of: Series: Dagstuhl Follow-Ups (DFU)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2017-02-21

PDF

File

PDF

DFU.Vol7.15301.79.pdf

Filesize: 0.61 MB
33 pages

Document Identifiers

DOI: 10.4230/DFU.Vol7.15301.79
URN: urn:nbn:de:0030-drops-69580

Subject Classification

Keywords

Constraint satisfaction problems
Numerical domains

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

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

Author Details

Manuel Bodirsky

Marcello Mamino

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail