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).
Abstract
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 (721Kb) |
| Status: | Peer-reviewed |
| Publisher Web site: | https://doi.org/10.4230/DFU.Vol7.15301.1 |
| 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
| Export: | |
| Look up in GoogleScholar |
