J. Almeida, M. V. Volkov, and S. V. Goldberg, Complexity of the identity checking problem for finite semigroups, Journal of Mathematical Sciences, vol.12, issue.6, pp.605-614, 2009.
DOI : 10.1007/s10958-009-9397-z

R. Baer, Engelsche Elemente Noetherscher Gruppen, Mathematische Annalen, vol.3, issue.3, pp.256-270, 1957.
DOI : 10.1007/BF02547953

S. Burris and J. Lawrence, The Equivalence Problem for Finite Rings, Journal of Symbolic Computation, vol.15, issue.1, pp.67-71, 1993.
DOI : 10.1006/jsco.1993.1004

S. Burris and J. Lawrence, Results on the equivalence problem for finite groups, algebra universalis, vol.52, issue.4, pp.495-500, 2004.
DOI : 10.1007/s00012-004-1895-8

M. Goldmann and A. Russell, The Complexity of Solving Equations over Finite Groups, Information and Computation, vol.178, issue.1, pp.253-262, 2002.
DOI : 10.1016/S0890-5401(02)93173-1

T. A. Gorazd and J. Krzaczkowski, The complexity of problems connected with two-element algebras, Reports on Mathematical Logic, vol.46, pp.91-108, 2011.

G. Horváth, The complexity of the equivalence and equation solvability problems over nilpotent rings and groups. Algebra Universalis, 2011.

G. Horváth and C. Szabó, THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS, International Journal of Algebra and Computation, vol.16, issue.05, pp.931-940, 2006.
DOI : 10.1142/S0218196706003256

G. Horváth and C. Szabó, Equivalence and equation solvability problems for the group A 4, J. Pure Appl. Algebra, 2011.

G. Horváth, J. Lawrence, L. Mérai, and C. Szabó, The complexity of the equivalence problem for nonsolvable groups, Bulletin of the London Mathematical Society, vol.39, issue.3, pp.433-438, 2007.
DOI : 10.1112/blms/bdm030

H. Hunt and R. Stearns, The complexity of equivalence for commutative rings, Journal of Symbolic Computation, vol.10, issue.5, pp.411-436, 1990.
DOI : 10.1016/S0747-7171(08)80053-3

N. Jacobson, The Radical and Semi-Simplicity for Arbitrary Rings, American Journal of Mathematics, vol.67, issue.2, pp.300-320, 1945.
DOI : 10.2307/2371731

R. M. Karp, Reducibility among combinatorial problems, Complexity of computer computations (Proc. Sympos, pp.85-103, 1972.

A. Kisielewicz, COMPLEXITY OF SEMIGROUP IDENTITY CHECKING, International Journal of Algebra and Computation, vol.14, issue.04, pp.455-464, 2004.
DOI : 10.1142/S0218196704001840

O. Klíma, Unification Modulo Associativity and Idempotency, 2004.

O. Klíma, Complexity issues of checking identities in finite monoids, Semigroup Forum, vol.132, issue.12, pp.435-444, 2009.
DOI : 10.1007/s00233-009-9180-y

J. Lawrence and R. Willard, The complexity of solving polynomial equations over finite rings. manuscript, 1997.

S. Plescheva and V. Vértesi, Checking identities in 0-simple semigroups (in Russian) Journal of, pp.72-102, 2006.

D. J. Robinson, A course in the theory of groups, 1995.

S. Seif and C. Szabó, Computational Complexity of Checking Identities in 0-Simple Semigroups and Matrix Semigroups over Finite Fields, Semigroup Forum, vol.72, issue.2, pp.207-222, 2006.
DOI : 10.1007/s00233-005-0510-4

. Cs, V. Szabó, and . Vértesi, The equivalence problem over finite rings, Internat. J. Algebra Comput, vol.21, issue.3, pp.449-457, 2011.