A fast algorithm for the construction of polynomials modulo~$k$ for $k$-valued functions for composite~$k$
Diskretnaya Matematika, Tome 23 (2011) no. 3, pp. 3-22
Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2011_23_3_a0,
author = {S. N. Selezneva},
title = {A fast algorithm for the construction of polynomials modulo~$k$ for $k$-valued functions for composite~$k$},
journal = {Diskretnaya Matematika},
pages = {3--22},
publisher = {mathdoc},
volume = {23},
number = {3},
year = {2011},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2011_23_3_a0/}
}
TY - JOUR AU - S. N. Selezneva TI - A fast algorithm for the construction of polynomials modulo~$k$ for $k$-valued functions for composite~$k$ JO - Diskretnaya Matematika PY - 2011 SP - 3 EP - 22 VL - 23 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DM_2011_23_3_a0/ LA - ru ID - DM_2011_23_3_a0 ER -
S. N. Selezneva. A fast algorithm for the construction of polynomials modulo~$k$ for $k$-valued functions for composite~$k$. Diskretnaya Matematika, Tome 23 (2011) no. 3, pp. 3-22. http://geodesic.mathdoc.fr/item/DM_2011_23_3_a0/