Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/10511
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mašulović, Dragan | en_US |
dc.date.accessioned | 2020-03-03T14:39:58Z | - |
dc.date.available | 2020-03-03T14:39:58Z | - |
dc.date.issued | 2008-08-01 | - |
dc.identifier.issn | 02181967 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/10511 | - |
dc.description.abstract | In 1999, Bergman et al. showed that the following two problems are EXPTIME-complete: GENCLO, which decides whether an operation on a finite set A belongs to a clone generated by a finite set of operations on A; and TERMEQUIV, which decides whether two algebras on the same finite set and with finitely many fundamental operations are term-equivalent. However, the proof of one of the key statements was not correct. Using the techniques proposed by Bergman et al., in this paper we present the correct proof. © 2008 World Scientific Publishing Company. | en |
dc.relation.ispartof | International Journal of Algebra and Computation | en |
dc.title | Genclo and termequiv are exptime-complete | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1142/S0218196708004639 | - |
dc.identifier.scopus | 2-s2.0-50949088642 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/50949088642 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 909 | en |
dc.relation.firstpage | 901 | en |
dc.relation.issue | 5 | en |
dc.relation.volume | 18 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0002-9958-8144 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
SCOPUSTM
Citations
1
checked on Sep 9, 2023
Page view(s)
5
Last Week
4
4
Last month
0
0
checked on May 3, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.