Campus Units
Computer Science, Mathematics
Document Type
Article
Publication Version
Accepted Manuscript
Publication Date
1999
Journal or Book Title
International Journal of Algebra and Computation
Volume
9
Issue
1
First Page
113
Last Page
128
DOI
10.1142/S0218196799000084
Abstract
Two algebraic structures with the same universe are called term-equivalent if they have the same clone of term operations. We show that the problem of determining whether two finite algebras of finite similarity type are term-equivalent is complete for deterministic exponential time.
Copyright Owner
World Scientific Publishing Company
Copyright Date
1999
Language
en
File Format
application/pdf
Recommended Citation
Bergman, Clifford; Juedes, David; and Slutzki, Giora, "Computational complexity of term-equivalence" (1999). Mathematics Publications. 220.
https://lib.dr.iastate.edu/math_pubs/220
Comments
This is a manuscript of an article published as Bergman, Clifford, David Juedes, and Giora Slutzki. "Computational complexity of term-equivalence." International Journal of Algebra and Computation 9, no. 01 (1999): 113-128. doi: 10.1142/S0218196799000084. Posted with permission.