Geodesic
An Improved Computational Algorithm for Finding the Factorial
Matematičeskie zametki, Tome 83 (2008) no. 6, pp. 857-863 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In the present paper, we consider a method for improving the computational algorithm for finding the factorials of integers; this method linearly accelerates the computations. We also present several algorithms effectively realizing this method and analyze their complexity.
Keywords: computational algorithm, factorial, algorithm complexity. 
@article{MZM_2008_83_6_a5,
     author = {A. V. Ladikov},
     title = {An {Improved} {Computational} {Algorithm} for {Finding} the {Factorial}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {857--863},
     year = {2008},
     volume = {83},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2008_83_6_a5/}
}
TY  - JOUR
AU  - A. V. Ladikov
TI  - An Improved Computational Algorithm for Finding the Factorial
JO  - Matematičeskie zametki
PY  - 2008
SP  - 857
EP  - 863
VL  - 83
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/MZM_2008_83_6_a5/
LA  - ru
ID  - MZM_2008_83_6_a5
ER  - 
%0 Journal Article
%A A. V. Ladikov
%T An Improved Computational Algorithm for Finding the Factorial
%J Matematičeskie zametki
%D 2008
%P 857-863
%V 83
%N 6
%U http://geodesic.mathdoc.fr/item/MZM_2008_83_6_a5/
%G ru
%F MZM_2008_83_6_a5
A. V. Ladikov. An Improved Computational Algorithm for Finding the Factorial. Matematičeskie zametki, Tome 83 (2008) no. 6, pp. 857-863. http://geodesic.mathdoc.fr/item/MZM_2008_83_6_a5/

[1] N. N. Kuzyurin, Lektsii po kursu “Slozhnost kombinatornykh algoritmov”, preprint ISPRAN, 2003

[2] D. E. Knut, Iskusstvo programmirovaniya, t. 2: Poluchislennye algoritmy, M., Izd. dom “Vilyams”, 2003 | MR | Zbl