The complexity of disjunctive linear Diophantine constraints
Computational Complexity
2018-07-04 v1 Logic
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.
Cite
@article{arxiv.1807.00985,
title = {The complexity of disjunctive linear Diophantine constraints},
author = {Manuel Bodirsky and Barnaby Martin and Marcello Mamino and Antoine Mottet},
journal= {arXiv preprint arXiv:1807.00985},
year = {2018}
}
Comments
To appear in the proceedings of MFCS 2018