Simple view
Full metadata view
Authors
Statistics
Absorbing subalgebra, cyclic terms and the constraint satisfaction problem
The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete otherwise. This paper provides two new characterizations of finitely generated Taylor varieties. The first characterization is using absorbing subalgebras and the second one cyclic terms. These new conditions allow us to reprove the conjecture of Bang-Jensen and Hell (proved by the authors) and the characterization of locally finite Taylor varieties using weak nearunanimity terms (proved by McKenzie and Mar´oti) in an elementary and self-contained way.
dc.abstract.en | The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete otherwise. This paper provides two new characterizations of finitely generated Taylor varieties. The first characterization is using absorbing subalgebras and the second one cyclic terms. These new conditions allow us to reprove the conjecture of Bang-Jensen and Hell (proved by the authors) and the characterization of locally finite Taylor varieties using weak nearunanimity terms (proved by McKenzie and Mar´oti) in an elementary and self-contained way. | en |
dc.affiliation | Wydział Matematyki i Informatyki : Zespół Katedr i Zakładów Informatyki Matematycznej | pl |
dc.contributor.author | Barto, Libor | pl |
dc.contributor.author | Kozik, Marcin - 129358 | pl |
dc.date.accessioned | 2014-08-01T14:24:44Z | |
dc.date.available | 2014-08-01T14:24:44Z | |
dc.date.issued | 2012 | pl |
dc.date.openaccess | 0 | |
dc.description.accesstime | w momencie opublikowania | |
dc.description.number | 1 | pl |
dc.description.version | ostateczna wersja wydawcy | |
dc.description.volume | 8 | pl |
dc.identifier.articleid | 7 | pl |
dc.identifier.doi | 10.2168/LMCS-8(1:7)2012 | pl |
dc.identifier.issn | 1860-5974 | pl |
dc.identifier.project | ROD UJ / P | pl |
dc.identifier.uri | http://ruj.uj.edu.pl/xmlui/handle/item/436 | |
dc.language | eng | pl |
dc.language.container | eng | pl |
dc.rights | Udzielam licencji. Uznanie autorstwa - Bez utworów zależnych 4.0 Międzynarodowa | * |
dc.rights.licence | CC-BY-ND | |
dc.rights.uri | http://creativecommons.org/licenses/by-nd/4.0/legalcode.pl | * |
dc.share.type | otwarte czasopismo | |
dc.subtype | Article | pl |
dc.title | Absorbing subalgebra, cyclic terms and the constraint satisfaction problem | pl |
dc.title.journal | Logical Methods in Computer Science | pl |
dc.type | JournalArticle | pl |
dspace.entity.type | Publication |
* The migration of download and view statistics prior to the date of April 8, 2024 is in progress.
Views
0
Views per month
Open Access