The complexity of disjunctive linear Diophantine constraints

07/03/2018

∙

by   Manuel Bodirsky, et al.

∙

0

∙

share

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.