2026-07-23T03:49:39Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6959 2024-03-06T10:28:03Z ddc:004 open_access

Polymorphisms, and How to Use Them Barto, Libor Krokhin, Andrei Willard, Ross Constraint satisfaction Complexity Universal algebra Polymorphism This article describes the algebraic approach to Constraint Satisfaction Problem that led to many developments in both CSP and universal algebra. No prior knowledge of universal algebra is assumed. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Libor Barto and Andrei Krokhin and Ross Willard 2017 Is Part Of Dagstuhl Follow-Ups, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability (2017) InCollection Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DFU.Vol7.15301.1 urn:nbn:de:0030-drops-69595 https://drops.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.1 eng https://creativecommons.org/licenses/by/3.0/legalcode