The complexity of checking the polynomial completeness of finite quasigroups

DOI10.1515/DMA-2020-0016zbMath1437.20052OpenAlexW3034323708MaRDI QIDQ783116

Anton E. Pankratiev, Aleksey V. Galatenko

Publication date: 30 July 2020

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2020-0016

zbMATH Keywords

quasigroupLatin squarepolynomial completeness

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) 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 ⋮ Strong polynomial completeness of almost all quasigroups

Cites Work

• Polynomially complete quasigroups of prime order
• Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
• Function Algebras on Finite Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of checking the polynomial completeness of finite quasigroups