@InProceedings{bodirsky_et_al:LIPIcs.MFCS.2018.33,
author = {Bodirsky, Manuel and Martin, Barnaby and Mamino, Marcello and Mottet, Antoine},
title = {{The Complexity of Disjunctive Linear Diophantine Constraints}},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
pages = {33:1--33:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-086-6},
ISSN = {1868-8969},
year = {2018},
volume = {117},
editor = {Potapov, Igor and Spirakis, Paul and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.33},
URN = {urn:nbn:de:0030-drops-96150},
doi = {10.4230/LIPIcs.MFCS.2018.33},
annote = {Keywords: Constraint Satisfaction, Presburger Arithmetic, Computational Complexity}
}