Constraint satisfaction problems over the integers with successor
- Submitting institution
-
Middlesex University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1407
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-662-47672-7_21
- Title of conference / published proceedings
- Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I
- First page
- 256
- Volume
- -
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Out of scope for open access requirements
- Month of publication
- June
- Year of publication
- 2015
- URL
-
http://eprints.mdx.ac.uk/16768/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper presents work in the complexity of constraint satisfaction problems (CSP) that involve a distance. The main result shows that every distance CSP is either in P or is NP-complete, unless it can be formulated as a finite domain CSP in which case the computational complexity is not known in general. This is significant because it continues to develop the boundary of problems on the P/ NP border. Moreover, it supports the discovery of whether particular distance CSP problems can be solved by practically tractable algorithms.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -