Geodesic
A method for constructing polynomials for functions of $k$-valued logic
Diskretnaya Matematika, Tome 7 (1995) no. 3, pp. 48-60 
D. G. Meshchaninov. A method for constructing polynomials for functions of $k$-valued logic. Diskretnaya Matematika, Tome 7 (1995) no. 3, pp. 48-60. http://geodesic.mathdoc.fr/item/DM_1995_7_3_a4/
@article{DM_1995_7_3_a4,
     author = {D. G. Meshchaninov},
     title = {A method for constructing polynomials for functions of $k$-valued logic},
     journal = {Diskretnaya Matematika},
     pages = {48--60},
     year = {1995},
     volume = {7},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1995_7_3_a4/}
}
TY  - JOUR
AU  - D. G. Meshchaninov
TI  - A method for constructing polynomials for functions of $k$-valued logic
JO  - Diskretnaya Matematika
PY  - 1995
SP  - 48
EP  - 60
VL  - 7
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/DM_1995_7_3_a4/
LA  - ru
ID  - DM_1995_7_3_a4
ER  - 
%0 Journal Article
%A D. G. Meshchaninov
%T A method for constructing polynomials for functions of $k$-valued logic
%J Diskretnaya Matematika
%D 1995
%P 48-60
%V 7
%N 3
%U http://geodesic.mathdoc.fr/item/DM_1995_7_3_a4/
%G ru
%F DM_1995_7_3_a4

Voir la notice de l'article provenant de la source Math-Net.Ru

Functions of $k$-valued logic are considered. Necessary and sufficient conditions for representability of functions by polynomials modulo $k$ are established for any composite integer $k$. The canonical form of a polynomial and the way of its construction are given. The complexity of the algorithm for recognizing polynomiality of a function and constructing its polynomial is estimated.