THE EQUIVALENCE PROBLEM OVER FINITE RINGS
Csaba Szabó, Vera Vértesi · International Journal of Algebra and Computation · 2011
We investigate the computational complexity of deciding whether or not a given polynomial, presented as the sum of monomials, is identically 0 over a ring. It is proved that if the factor by the Jacobson-radical is not commutative, then the problem is coNP-complete.