THE EQUIVALENCE PROBLEM OVER FINITE RINGS

DOI10.1142/S021819671100625XzbMath1220.16019MaRDI QIDQ3006615

Vera Vértesi, Csaba Szabó

Publication date: 20 June 2011

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

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

zbMATH Keywords

computational complexity; finite rings; nilpotent rings; equivalence problem; ring terms; co-NP-complete problems

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

16P10: Finite rings and finite-dimensional associative algebras

16N40: Nil and nilpotent radicals, sets, ideals, associative rings

08A40: Operations and polynomials in algebraic structures, primal algebras

Related Items

The equation solvability problem over supernilpotent algebras with Mal’cev term, The complexity of the equivalence and equation solvability problems over nilpotent rings and groups., The complexity of the equivalence and equation solvability problems over meta-abelian groups, The complexity of the equation solvability problem over semipattern groups, THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS

Cites Work

• The complexity of equivalence for commutative rings
• The equivalence problem for finite rings
• Results on the equivalence problem for finite groups.
• The complexity of the word-problem for finite matrix rings
• The complexity of the equivalence problem for nonsolvable groups