Polynomially complete quasigroups of prime order

DOI10.1007/S10469-018-9505-6MaRDI QIDQ1731318zbMATH OpenOpenAlexWikidataFDO

Authors A. V. Galatentko, S. B. Rodin, Anton E. Pankratiev

Publication date 13 March 2019

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10469-018-9505-6

zbMATH Keywords

Latin square\(n\)-quasigrouppolynomially complete quasigroup

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05)

Recommendations

• The complexity of checking the polynomial completeness of finite quasigroups
• scientific article; zbMATH DE number 6288955
• On \(n\)-ary polynomially complete quasigroups
• Efficient verification of polynomial completeness of quasigroups
• Constructions of polynomially complete quasigroups of arbitrary order

Cites work

• scientific article; zbMATH DE number 3771592 (Why is no real title available?)
• scientific article; zbMATH DE number 1033192 (Why is no real title available?)
• scientific article; zbMATH DE number 6761101 (Why is no real title available?)
• scientific article; zbMATH DE number 6288955 (Why is no real title available?)
• scientific article; zbMATH DE number 3340244 (Why is no real title available?)
• An assertion concerning functionally complete algebras and NP-completeness
• Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
• Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations.
• Communication Theory of Secrecy Systems*
• Function Algebras on Finite Sets

Cited in

(14)

• scientific article; zbMATH DE number 2097987 (Why is no real title available?)
• Constructions of polynomially complete quasigroups of arbitrary order
• Prime injections and quasipolarities
• Algebraic properties of subquasigroups and construction of finite quasigroups
• Strong polynomial completeness of almost all quasigroups
• Polynomial \(n\)-ary quasigroups.
• Automorphisms of finite quasi-groups without sub-quasi-groups
• Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete
• Algorithms for checking some properties of \(n\)-quasigroups
• Efficient verification of polynomial completeness of quasigroups
• On \(n\)-ary polynomially complete quasigroups
• The complexity of checking the polynomial completeness of finite quasigroups
• Quasigroups and their applications
• Latin squares over quasigroups

This page was built for publication: Polynomially complete quasigroups of prime order

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