@InProceedings{dose:LIPIcs.MFCS.2016.32, author = {Dose, Titus}, title = {{Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {32:1--32:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.32}, URN = {urn:nbn:de:0030-drops-64461}, doi = {10.4230/LIPIcs.MFCS.2016.32}, annote = {Keywords: computational complexity, constraint satisfaction problems, integer expressions and circuits} }