The complexity of disjunctive linear Diophantine constraints

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.