The extended equivalence and equation solvability problems for groups

We prove that the extended equivalence problem is solvable in polynomial time for finite nilpotent groups, and coNP-complete, otherwise. We prove that the extended equation solvability problem is solvable in polynomial time for finite nilpotent groups, and NP-complete, otherwise.

[1]  N. Jacobson.  The Radical and Semi-Simplicity for Arbitrary Rings , 1945 .

[2]  Alexander Russell,et al.  The complexity of solving equations over finite groups , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[3]  Stanley Burris,et al.  Results on the equivalence problem for finite groups , 2005 .

[4]  D. Robinson.  A Course in the Theory of Groups , 1982 .

[5]  Andrzej Kisielewicz,et al.  Complexity of Semigroup Identity Checking , 2004, Int. J. Algebra Comput..

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

[7]  Ondřej Klíma.  Complexity issues of checking identities in finite monoids , 2009 .

[8]  Csaba Szabó,et al.  The Equivalence Problem over Finite Rings , 2011, Int. J. Algebra Comput..

[9]  Stanley Burris,et al.  The Equivalence Problem for Finite Rings , 1993, J. Symb. Comput..

[10]  Alexander Russell,et al.  The complexity of solving equations over finite groups , 2002 .

[11]  R. Baer.  Engelsche Elemente Noetherscher Gruppen , 1957 .

[12]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[13]  Tomasz A. Gorazd,et al.  The complexity of problems connected with two-element algebras , 2011, Reports Math. Log..

[14]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[15]  Steve Seif,et al.  Computational Complexity of Checking Identities in 0-Simple Semigroups and Matrix Semigroups over Finite Fields , 2006 .

[16]  Harry B. Hunt,et al.  The Complexity of Equivalence for Commutative Rings , 1990, J. Symb. Comput..

[17]  Mikhail Volkov,et al.  Complexity of the identity checking problem for finite semigroups , 2009 .

[18]  Csaba A. Szabó,et al.  The Complexity of Checking Identities over Finite Groups , 2006, Int. J. Algebra Comput..

[19]  László Mérai,et al.  THE COMPLEXITY OF THE EQUIVALENCE PROBLEM FOR NONSOLVABLE GROUPS , 2007 .