Bodirsky, Manuel and Martin, Barnaby and Mottet, Antoine (2015) 'Constraint satisfaction problems over the integers with successor.', in Automata, languages, and programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015. Proceedings. Part I. Berlin: Springer, pp. 256-267. Lecture notes in computer science. (9134).
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)(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.
|Item Type:||Book chapter|
|Full text:||(AM) Accepted Manuscript|
Download PDF (258Kb)
|Publisher Web site:||https://doi.org/10.1007/978-3-662-47672-7_21|
|Publisher statement:||The final publication is available at Springer via https://doi.org/10.1007/978-3-662-47672-7_21|
|Date accepted:||04 April 2015|
|Date deposited:||17 October 2016|
|Date of first online publication:||20 June 2015|
|Date first made open access:||No date available|
Save or Share this output
|Look up in GoogleScholar|