CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
The complexity of disjunctive linear Diophantine constraints.
Authors
Manuel Bodirsky
Marcello Mamino
+5 more
Barnaby Martin
Antoine Mottet
Igor Potapov
Paul Spirakis
James Worrell
Publication date
1 January 2018
Publisher
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing
Doi
Cite
View
on
arXiv
Abstract
We study the Constraint Satisfaction Problem CSP( A), where A is first-order definable in (Z;+,1) and contains +. We prove such problems are either in P or NP-complete
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Archivio della Ricerca - Università di Pisa
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arpi.unipi.it:11568/103287...
Last time updated on 30/03/2020
Dagstuhl Research Online Publication Server
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:drops-oai.dagstuhl.de:9615
Last time updated on 27/08/2018
Durham Research Online
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:durham-repository.worktrib...
Last time updated on 14/08/2023