A method for constructing polynomials for functions of $k$-valued logic

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.