1 results
Filters
Settings
Now showing1 - 1 of 1
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , Constraint satisfaction problems over the integers with successor(2015-07); ; A distance constraint satisfaction problem is a constraint satisfaction problem (CSP) whose constraint language consists of relations that are first-order definable over (Z; succ), i. e., over the integers with the successor function. Our main result says that every distance CSP is in P or NP-complete, unless it can be formulated as a finite domain CSP in which case the computational complexity is not known in general.Publicationtype: Conference Paper38