Polynomially complete quasigroups of prime order
From MaRDI portal
Recommendations
Cites work
- 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
- 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?)
Cited in
(14)- Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete
- Strong polynomial completeness of almost all quasigroups
- Algorithms for checking some properties of \(n\)-quasigroups
- Efficient verification of polynomial completeness of quasigroups
- Latin squares over quasigroups
- Automorphisms of finite quasi-groups without sub-quasi-groups
- scientific article; zbMATH DE number 2097987 (Why is no real title available?)
- Polynomial n-ary quasigroups.
- Constructions of polynomially complete quasigroups of arbitrary order
- Quasigroups and their applications
- On n-ary polynomially complete quasigroups
- Prime injections and quasipolarities
- Algebraic properties of subquasigroups and construction of finite quasigroups
- The complexity of checking the polynomial completeness of finite 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)