TY - JOUR
AU - Alizadeh, Mahmood
PY - 2021/12/10
Y2 - 2024/05/21
TI - Computation of the Complexity of some Recursive Constructed Normal Polynomials
JF - Mathematical Problems of Computer Science
JA - MPCS
VL - 36
IS -
SE - Articles
DO -
UR - http://mpcs.sci.am/index.php/mpcs/article/view/266
SP - 57-62
AB - <p>In this paper we give some algorithms for computing the complexity of some normal polynomials constructed by some recurrent methods. Finally some results of our algorithms are given in a table.</p>
ER -