Efficient verification of polynomial completeness of quasigroups

DOI10.1134/S1995080220080053zbMath1491.20153MaRDI QIDQ2206949

Vladimir M. Staroverov, Aleksey V. Galatenko, Anton E. Pankratiev

Publication date: 27 October 2020

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

affinity; quasigroup; parallel implementation; simplicity; polynomial completeness

Mathematics Subject Classification ID

20N05: Loops, quasigroups

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)