Computer Science, Mathematics
Journal or Book Title
International Journal of Algebra and Computation
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.
World Scientific Publishing Company
Bergman, Clifford; Juedes, David; and Slutzki, Giora, "Computational complexity of term-equivalence" (1999). Mathematics Publications. 220.