Quantified Constraints in Twenty Seventeen
Barnaby D. Martin · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2017
I present a survey of recent advances in the algorithmic and computational complexity theory of non-Boolean Quantified Constraint Satisfaction Problems, incorporating some more modern research directions.