Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/28520
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Idziak Paweł | - |
dc.contributor.author | Marković Petar | - |
dc.contributor.author | McKenzie Ralph | - |
dc.contributor.author | Valeriote Matthew | - |
dc.contributor.author | Willard Ross | - |
dc.date.accessioned | 2020-12-14T15:29:19Z | - |
dc.date.available | 2020-12-14T15:29:19Z | - |
dc.date.issued | 2010 | - |
dc.identifier.issn | 0097-5397 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/28520 | - |
dc.description.abstract | A constraint language $\Gamma$ on a finite set A has been called polynomially expressive if the number of n-ary relations expressible by $\exists\wedge$-atomic formulas over $\Gamma$ is bounded by $\exp(O(n^k))$ for some constant k. It has recently been discovered that this property is characterized by the existence of a $(k+1)$-ary polymorphism satisfying certain identities; such polymorphisms are called k-edge operations and include Mal'cev and near-unanimity operations as special cases. We prove that if $\Gamma$ is any constraint language which, for some $k>1$, has a k-edge operation as a polymorphism, then the constraint satisfaction problem for $\langle\Gamma\rangle$ (the closure of $\Gamma$ under $\exists\wedge$-atomic expressibility) is globally tractable. We also show that the set of relations definable over $\Gamma$ using quantified generalized formulas is polynomially exactly learnable using improper equivalence queries. | en |
dc.language.iso | en | - |
dc.relation.ispartof | SIAM Journal on Computing / Society for Industrial and Applied Mathematics | en |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.subject | constraint satisfactionlearnabilitycomplexitypolymorphismMal'cevnear-unanimitypolynomially expressivefew subpowers | en |
dc.title | Tractability and Learnability Arising from Algebras with Few Subpowers | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.doi | 10.1137/090775646 | - |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=84115&source=BEOPEN&language=en | en |
dc.relation.lastpage | 3037 | - |
dc.relation.firstpage | 3023 | - |
dc.relation.issue | 7 | - |
dc.relation.volume | 39 | - |
dc.identifier.externalcrisreference | (BISIS)84115 | - |
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.