Efficient verification of polynomial completeness of quasigroups

DOI10.1134/S1995080220080053zbMath1491.20153OpenAlexW3094161958MaRDI QIDQ2206949

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

Publication date: 27 October 2020

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

Full work available at URL: https://doi.org/10.1134/s1995080220080053

zbMATH Keywords

affinityquasigroupparallel implementationsimplicitypolynomial completeness

Mathematics Subject Classification ID

Loops, quasigroups (20N05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Algorithms for checking some properties of \(n\)-quasigroups ⋮ Generation of proper families of functions

Cites Work

• An assertion concerning functionally complete algebras and NP-completeness
• Nonassociative algebraic structures in cryptography and coding
• Generating uniformly distributed random latin squares
• Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
• Function Algebras on Finite Sets
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• Unnamed Item

This page was built for publication: Efficient verification of polynomial completeness of quasigroups