Pages that link to "Item:Q3502845"
From MaRDI portal
The following pages link to COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS (Q3502845):
Displayed 3 items.
- Complexity of the identity checking problem for finite semigroups. (Q843593) (← links)
- A minimal nonfinitely based semigroup whose variety is polynomially recognizable. (Q2248321) (← links)
- The computational complexity of deciding whether a finite algebra generates a minimal variety (Q4586419) (← links)