We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Polymorphisms, and how to use them.

Barto, L. and Krokhin, A. and Willard, R. (2017) 'Polymorphisms, and how to use them.', in The constraint satisfaction problem : complexity and approximability. Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 1-44. Dagstuhl follow-ups. (7).


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.

Item Type:Book chapter
Full text:(VoR) Version of Record
Available under License - Creative Commons Attribution.
Download PDF
Publisher Web site:
Publisher statement:© Libor Barto, Andrei Krokhin, and Ross Willard; licensed under Creative Commons License BY
Date accepted:No date available
Date deposited:10 March 2017
Date of first online publication:2017
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar