CD(4) has bounded width

Simple item page
dc.creatorCarvalho, Catarina
dc.creatorDalmau, Víctor
dc.creatorMarković, Petar
dc.creatorMaróti, Miklós
dc.date2007-09-12
dc.date.accessioned2026-07-07T08:29:11Z
dc.date.available2026-07-07T08:29:11Z
dc.descriptionWe prove that the constraint languages invariant under a short sequence of Jónsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they have bounded width. This improves the previous result by Kiss and Valeriote and presents some evidence that the Larose-Zadori conjecture holds in the congruence-distributive case.
dc.identifierhttps://arxiv.org/abs/0709.1934
dc.identifierhttp://arxiv.org/abs/0709.1934
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137879
dc.subjectLogic
dc.subjectComputational Complexity
dc.subject68N17 (Primary) 08A70, 08B10, 08B05, 03B70, 68T20 (Secondary)
dc.titleCD(4) has bounded width
dc.typetext

Files

Collections

arXiv