GENCLO AND TERMEQUIV ARE EXPTIME-COMPLETE

DOI10.1142/S0218196708004639zbMath1286.08004OpenAlexW2069058413MaRDI QIDQ3528857

Dragan Mašulović

Publication date: 17 October 2008

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196708004639

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items (1)

On the complexity of the clone membership problem

Cites Work

• COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE

This page was built for publication: GENCLO AND TERMEQUIV ARE EXPTIME-COMPLETE