COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
Clifford Bergman, David W. Juedes, Giora Slutzki · International Journal of Algebra and Computation · 1999
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.