Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/10511
DC FieldValueLanguage
dc.contributor.authorMašulović, Draganen_US
dc.date.accessioned2020-03-03T14:39:58Z-
dc.date.available2020-03-03T14:39:58Z-
dc.date.issued2008-08-01-
dc.identifier.issn02181967en_US
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/10511-
dc.description.abstractIn 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.ispartofInternational Journal of Algebra and Computationen
dc.titleGenclo and termequiv are exptime-completeen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1142/S0218196708004639-
dc.identifier.scopus2-s2.0-50949088642-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/50949088642-
dc.description.versionUnknownen_US
dc.relation.lastpage909en
dc.relation.firstpage901en
dc.relation.issue5en
dc.relation.volume18en
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptPrirodno-matematički fakultet, Departman za matematiku i informatiku-
crisitem.author.orcid0000-0002-9958-8144-
crisitem.author.parentorgPrirodno-matematički fakultet-
Appears in Collections:PMF Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

1
checked on Sep 9, 2023

Page view(s)

5
Last Week
4
Last month
0
checked on May 3, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.