The computational complexity of deciding whether a finite algebra generates a minimal variety (Q4586419)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6935923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.92045206
0 references
0.9059972
0 references
0.89534867
0 references
0.8936615
0 references
0.88180625
0 references
0.88143057
0 references
0.8799911
0 references
