|
|
|
|
References
|
|
| |
| 1. |
A. V. Galatenko, A. E. Pankratev, S. B. Rodin, “O polinomialno polnykh kvazigruppakh prostogo poryadka”, Algebra i logika, prinyato k pechati  |
| 2. |
M. M. Glukhov, “O primeneniyakh kvazigrupp v kriptografii”, Prikladnaya diskretnaya matematika, 2008, no. 2, 28–32   |
| 3. |
V. L. Yugai, “Ob odnom kriterii polinomialnoi polnoty kvazigrupp”, Intellektualnye sistemy. Teoriya i prilozheniya, 21:3 (2017), 131–135 |
| 4. |
V. A. Artamonov, S. Chakrabarti, S. K. Pal, “Characterizations of highly non-associative quasigroups and associative triples”, Quasigroups and Related Systems, 25 (2017), 1–19  |
| 5. |
V. A. Artamonov, S. Chakrabarti, S. Gangopadhyay, S. K. Pal, “On Latin squares of polynomially complete quasigroups and quasigroups generated by shifts”, Quasigroups and Related Systems, 21 (2013), 117–130 |
| 6. |
J. Hagemann, C. Herrmann, “Arithmetical locally equational classes and representation of partial functions”, Universal Algebra, Esztergom (Hungary), 29 (1982), 345–360 |
| 7. |
G. Horváth, Gh. L. Nehaniv, Cs. Szabó, “An assertion concerning functionally complete algebras and NP-completeness”, Acta Sci. Math. (Szeged), 76 (2010), 35–48 |
| 8. |
D. Knuth, The Art of Computer Programming, v. 2, Seminumerical Algorithms, 3, Addison-Wesley, 2008 |
| 9. |
D. Lau, Function algebras on finite sets: a basic course on many-valued logic and clone theory, Springer, 2006 |
