Quantified Constraint Satisfaction on Monoids

We contribute to a research program that aims to classify, for each finite structure, the computational complexity of the quantified constraint satisfaction problem on the structure. Employing an established algebraic viewpoint to studying this problem family, whereby this classification program can be phrased as a classification of algebras, we give a complete classification of all finite monoids.

Authors

• Hubie Chen
• Peter Mayr 0001

Keywords

• quantified constraint satisfaction
• universal algebra
• computational complexity