pith. sign in

arxiv: 1807.00985 · v1 · pith:U4YJAXIJnew · submitted 2018-07-03 · 💻 cs.CC · math.LO

The complexity of disjunctive linear Diophantine constraints

Manuel Bodirsky , Barnaby Martin , Marcello Mamino , Antoine Mottet This is my paper
classification 💻 cs.CC math.LO
keywords complexityconstraintconstraintscontainsdefinablediophantinedisjunctiveeither
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.