The computational complexity of deciding whether a finite algebra generates a minimal variety (Q4586419)
From MaRDI portal
scientific article; zbMATH DE number 6935923
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of deciding whether a finite algebra generates a minimal variety |
scientific article; zbMATH DE number 6935923 |
Statements
The computational complexity of deciding whether a finite algebra generates a minimal variety (English)
0 references
13 September 2018
0 references
minimal variety of algebras
0 references
NP-hardness
0 references
finite algebra decision problems
0 references
