The complexity of checking identities for finite matrix rings

DOI10.1007/s00012-004-1873-1zbMath1081.03043OpenAlexW1572220122MaRDI QIDQ2583608

Vera Vértesi, Csaba Szabó

Publication date: 17 January 2006

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00012-004-1873-1

zbMATH Keywords

complexityidentity checkingfinite matrix ringsterm-equivalenceword-problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Word problems, etc. in computability and recursion theory (03D40) Word problems (aspects of algebraic structures) (08A50)

Related Items (5)

Complexity of the identity checking problem for finite semigroups. ⋮ Complexity issues of checking identities in finite monoids ⋮ Identity checking problem for transformation monoids ⋮ The complexity of the equivalence and equation solvability problems over nilpotent rings and groups. ⋮ Word problem of the Perkins semigroup via directed acyclic graphs.

This page was built for publication: The complexity of checking identities for finite matrix rings