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  -