The complexity of disjunctive linear Diophantine constraints
Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet
TL;DR
This paper investigates the computational complexity of a class of constraint satisfaction problems involving disjunctive linear Diophantine constraints, establishing a dichotomy between problems solvable in polynomial time and those that are NP-complete.
Contribution
It proves a complexity classification for CSPs definable in (Z;+,1) with disjunctive linear Diophantine constraints, showing they are either in P or NP-complete.
Findings
CSP(A) problems are either in P or NP-complete.
The classification depends on the definability within (Z;+,1).
The paper provides a clear dichotomy result.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Commutative Algebra and Its Applications · graph theory and CDMA systems