The complexity of the equivalence and equation solvability problems over nilpotent rings and groups

It is proved that the equation solvability problem can be solved in polynomial time for finite nilpotent rings. Ramsey’s theorem is employed in the proof. Then, using the same technique, a theorem of Goldmann and Russell is reproved: the equation solvability problem can be solved in polynomial time for finite nilpotent groups.