THE EQUIVALENCE PROBLEM OVER FINITE RINGS

DOI10.1142/S021819671100625XzbMath1220.16019OpenAlexW2136969434MaRDI 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 complexityfinite ringsnilpotent ringsequivalence problemring termsco-NP-complete problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite rings and finite-dimensional associative algebras (16P10) Nil and nilpotent radicals, sets, ideals, associative rings (16N40) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items (5)

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

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

This page was built for publication: THE EQUIVALENCE PROBLEM OVER FINITE RINGS