Constraint satisfaction problems over the integers with successor

Bodirsky, Manuel, Martin, Barnaby and Mottet, Antoine (2015) Constraint satisfaction problems over the integers with successor. Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I. In: 42nd International Colloquium Automata, Languages, and Programming (ICALP 2015), 1-10 Jul 2015, Kyoto, Japan. ISBN 9783662476710. ISSN 0302-9743


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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Paper published in: Automata, Languages, and Programming,
Volume 9134 of the series Lecture Notes in Computer Science, pp 256-267
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 16768
Depositing User: Barnaby Martin
Date Deposited: 03 Jun 2015 11:31
Last Modified: 24 Apr 2018 11:29

Actions (login required)

Edit Item Edit Item