A method for constructing polynomials for functions of $k$-valued logic
Diskretnaya Matematika, Tome 7 (1995) no. 3, pp. 48-60
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.
@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},
publisher = {mathdoc},
volume = {7},
number = {3},
year = {1995},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_1995_7_3_a4/}
}
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/