Strong polynomial completeness of almost all quasigroups

DOI10.1134/S0001434622010023zbMATH Open1491.20152MaRDI QIDQ2113390FDOQ2113390

Authors: Aleksey V. Galatenko, Vladimir V. Galatenko, Anton E. Pankratiev 

Publication date: 14 March 2022

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

affinitysimplicityisotopyquasigrouppolynomial completeness

Mathematics Subject Classification ID

Loops, quasigroups (20N05)

Cites Work

• Generating uniformly distributed random latin squares
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
• Polynomially complete quasigroups of prime order
• Title not available (Why is that?)
• The complexity of checking the polynomial completeness of finite quasigroups
• Title not available (Why is that?)
• Title not available (Why is that?)
• An assertion concerning functionally complete algebras and NP-completeness
• Almost all quasigroups have rank 2
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Strong polynomial completeness of almost all quasigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113390)