Computational Complexity of Term-Equivalence

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.

[1]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[2]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[3]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[4]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[5]  Nicholas Pippenger,et al.  Theories of computability , 1997 .

[6]  Pierre McKenzie,et al.  Oracle branching programs and Logspace versus P , 1989, Inf. Comput..

[7]  Dexter Kozen,et al.  Automata and Computability , 1997, Undergraduate Texts in Computer Science.

[8]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, STOC '74.

[9]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .