License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DFU.Vol7.15301.1
URN: urn:nbn:de:0030-drops-69595
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/6959/
Go to the corresponding DFU Volume Portal

Barto, Libor ; Krokhin, Andrei ; Willard, Ross

Polymorphisms, and How to Use Them

pdf-format:
DFU-Vol7-15301-1.pdf (0.7 MB)

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.

BibTeX - Entry

@InCollection{barto_et_al:DFU:2017:6959,
  author =	{Libor Barto and Andrei Krokhin and Ross Willard},
  title =	{{Polymorphisms, and How to Use Them}},
  booktitle =	{The Constraint Satisfaction Problem: Complexity and Approximability},
  pages =	{1--44},
  series =	{Dagstuhl Follow-Ups},
  ISBN =	{978-3-95977-003-3},
  ISSN =	{1868-8977},
  year =	{2017},
  volume =	{7},
  editor =	{Andrei Krokhin and Stanislav Zivny},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/6959},
  URN =		{urn:nbn:de:0030-drops-69595},
  doi =		{10.4230/DFU.Vol7.15301.1},
  annote =	{Keywords: Constraint satisfaction, Complexity, Universal algebra, Polymorphism}
}

Keywords: Constraint satisfaction, Complexity, Universal algebra, Polymorphism
Collection: The Constraint Satisfaction Problem: Complexity and Approximability
Issue Date: 2017
Date of publication: 21.02.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI