Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/10511
Title: | Genclo and termequiv are exptime-complete | Authors: | Mašulović, Dragan | Issue Date: | 1-Aug-2008 | Journal: | International Journal of Algebra and Computation | 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. | URI: | https://open.uns.ac.rs/handle/123456789/10511 | ISSN: | 02181967 | DOI: | 10.1142/S0218196708004639 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
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.