Pages that link to "Item:Q2655464"
From MaRDI portal
The following pages link to Complexity issues of checking identities in finite monoids (Q2655464):
Displayed 9 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)
- Checking quasi-identities in a finite semigroup may be computationally hard. (Q1770618) (← links)
- Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\). (Q1934970) (← links)
- On finitely related semigroups. (Q1955601) (← links)
- A minimal nonfinitely based semigroup whose variety is polynomially recognizable. (Q2248321) (← links)
- The complexity of the equivalence and equation solvability problems over meta-abelian groups (Q2343499) (← links)
- Monoids with sub-log-exponential free spectra. (Q2475114) (← links)