Pages that link to "Item:Q2583608"
From MaRDI portal
The following pages link to The complexity of checking identities for finite matrix rings (Q2583608):
Displaying 5 items.
- Identity checking problem for transformation monoids (Q444673) (← links)
- The complexity of the equivalence and equation solvability problems over nilpotent rings and groups. (Q652516) (← links)
- Complexity of the identity checking problem for finite semigroups. (Q843593) (← links)
- Word problem of the Perkins semigroup via directed acyclic graphs. (Q953264) (← links)
- Complexity issues of checking identities in finite monoids (Q2655464) (← links)