pith. sign in

arxiv: 0709.1934 · v1 · submitted 2007-09-12 · 🧮 math.LO · cs.CC

CD(4) has bounded width

Catarina Carvalho , V\'ictor Dalmau , Petar Markovi\'c , Mikl\'os Mar\'oti This is my paper
classification 🧮 math.LO cs.CC
keywords boundedtermswidthcasecongruence-distributiveconjectureconstraintcontaining
0
0 comments X
read the original abstract

We prove that the constraint languages invariant under a short sequence of J\'onsson 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.