RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive

Diskr. Mat., 2011 Volume 23, Issue 3, Pages 3–22 (Mi dm1149)

This article is cited in 8 papers

A fast algorithm for the construction of polynomials modulo $k$ for $k$-valued functions for composite $k$

S. N. Selezneva


UDC: 519.7

Received: 16.02.2011

DOI: 10.4213/dm1149


 English version:
Discrete Mathematics and Applications, 2011, 21:5-6, 651–674

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025