The complexity of checking the polynomial completeness of finite quasigroups (Q783116)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of checking the polynomial completeness of finite quasigroups |
scientific article; zbMATH DE number 7226071
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of checking the polynomial completeness of finite quasigroups |
scientific article; zbMATH DE number 7226071 |
Statements
The complexity of checking the polynomial completeness of finite quasigroups (English)
0 references
30 July 2020
0 references
quasigroup
0 references
Latin square
0 references
polynomial completeness
0 references
0 references
0.8605489134788513
0 references
0.8381386399269104
0 references
0.8269414305686951
0 references
0.8130863308906555
0 references
