Bodirsky, ManuelManuelBodirskyMartin, BarnabyBarnabyMartinMamino, MarcelloMarcelloMaminoMottet, AntoineAntoineMottet2022-03-242022-03-242018-0843rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) 117: 33 (2018)http://hdl.handle.net/11420/12093We 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.enComputational complexityConstraint satisfactionPresburger arithmeticConference Paper10.4230/LIPIcs.MFCS.2018.33Other