2026-07-24T01:58:42Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6555 2024-03-06T10:38:42Z ddc:004 open_access

Quantified Constraint Satisfaction on Monoids Chen, Hubie Mayr, Peter quantified constraint satisfaction universal algebra computational complexity 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Hubie Chen and Peter Mayr 2016 Is Part Of LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2016.15 urn:nbn:de:0030-drops-65553 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.15 eng https://creativecommons.org/licenses/by/3.0/legalcode