THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS

DOI10.1017/S001708951100053XzbMath1235.16041OpenAlexW1975052726MaRDI QIDQ3116848

Gábor Horváth

Publication date: 12 February 2012

Published in: Glasgow Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s001708951100053x

zbMATH Keywords

computational complexityfinite ringsequivalence problemring terms

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) Computational aspects of associative rings (general theory) (16Z05)

Related Items (6)

The complexity of the equation solvability problem over nilpotent groups ⋮ The complexity of the equivalence and equation solvability problems over nilpotent rings and groups. ⋮ The complexity of the equation solvability problem over semipattern groups ⋮ Solving a fixed number of equations over finite groups ⋮ The equation solvability problem over supernilpotent algebras with Mal’cev term ⋮ 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
• THE EQUIVALENCE PROBLEM OVER FINITE RINGS
• TERM REWRITE RULES FOR FINITE FIELDS
• The complexity of the equivalence problem for nonsolvable groups

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