Polymorphisms, and how to use them

Barto, L.; Krokhin, A.; Willard, R.

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.

Citation

Barto, L., Krokhin, A., & Willard, R. (2017). Polymorphisms, and how to use them. In A. Krokhin, & S. Živný (Eds.), The constraint satisfaction problem : complexity and approximability (1-44). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/dfu.vol7.15301.1

• Publication Date: Jan 1, 2017
• Deposit Date: Mar 9, 2017
• Publicly Available Date: Mar 10, 2017
• Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
• Pages: 1-44
• Series Title: Dagstuhl follow-ups
• Book Title: The constraint satisfaction problem : complexity and approximability.
• Chapter Number: 1
• DOI: https://doi.org/10.4230/dfu.vol7.15301.1
• Public URL: https://durham-repository.worktribe.com/output/1639996