Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/28511
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Carvalho Catarina | - |
dc.contributor.author | Dalmau Victor | - |
dc.contributor.author | Marković Petar | - |
dc.contributor.author | Maróti Miklós | - |
dc.date.accessioned | 2020-12-14T15:28:33Z | - |
dc.date.available | 2020-12-14T15:28:33Z | - |
dc.date.issued | 2009 | - |
dc.identifier.issn | 0002-5240 | - |
dc.identifier.issn | 1420-8911 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/28511 | - |
dc.description.abstract | We 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 a previous result by Kiss and Valeriote and presents some evidence that the Larose–Zádori conjecture holds in the congruence-distributive case. | en |
dc.language.iso | en | - |
dc.relation.ispartof | Algebra Universalis | en |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.subject | constraint satisfaction problembounded widthcongruence distributivity | en |
dc.title | CD(4) has bounded width | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.doi | 10.1007/s00012-009-2113-5 | - |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=84086&source=BEOPEN&language=en | en |
dc.relation.lastpage | 307 | - |
dc.relation.firstpage | 293 | - |
dc.relation.issue | 3 | - |
dc.relation.volume | 60 | - |
dc.identifier.externalcrisreference | (BISIS)84086 | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.