UPDF AI

Quantified Constraint Satisfaction on Monoids

Hubie Chen,P. Mayr

2016 · DOI: 10.4230/LIPIcs.CSL.2016.15
Annual Conference for Computer Science Logic · 5 Citations

TLDR

A complete classification of all finite monoids is given, for each finite structure, the computational complexity of the quantified constraint satisfaction problem on the structure.