Dagstuhl Follow-Ups. The Constraint Satisfaction Problem: Complexity and Approximability
Doi
Abstract
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
