The complexity of checking identities for finite matrix rings

DOI10.1007/S00012-004-1873-1MaRDI QIDQ2583608zbMATH OpenOpenAlexFDO

Authors Vera Vertesi, 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

complexityfinite matrix ringsidentity checkingterm-equivalenceword-problem

Mathematics Subject Classification ID

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

Recommendations

• The complexity of the word-problem for finite matrix rings
• THE EQUIVALENCE PROBLEM OVER FINITE RINGS
• The equivalence problem for finite rings
• Identity checking problem for transformation monoids
• Complexity issues of checking identities in finite monoids

Cited in

(9)

• Complexity issues of checking identities in finite monoids
• Identity checking problem for transformation monoids
• scientific article; zbMATH DE number 1752705 (Why is no real title available?)
• The complexity of the word-problem for finite matrix rings
• scientific article; zbMATH DE number 7204372 (Why is no real title available?)
• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• Hardness of equations over finite solvable groups under the exponential time hypothesis
• Complexity of the identity checking problem for finite semigroups.
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583608)