Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers

Titus Dose. Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. In Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, editors, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland. Volume 58 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

Abstract

Abstract is missing.