Analysis of some algorithms for smooth integers recognition
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 107-110
Cet article a éte moissonné depuis la source Math-Net.Ru
The experimental comparison of three sieving algorithms by run time and memory amount is presented.
Keywords:
smooth numbers, sieving, Bernstein algorithm.
@article{PDMA_2013_6_a48,
author = {D. S. Arbuzov and L. I. Tuktarova},
title = {Analysis of some algorithms for smooth integers recognition},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {107--110},
year = {2013},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a48/}
}
D. S. Arbuzov; L. I. Tuktarova. Analysis of some algorithms for smooth integers recognition. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 107-110. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a48/
[1] Glukhov M. M., Kruglov I. A., Pikchur A. B., Cheremushkin A. V., Vvedenie v teoretiko-chislovye metody kriptografii, Uchebnik dlya vuzov, Lan, M., 2011
[2] Krendall R., Pomerans K., Prostye chisla: kriptograficheskie i vychislitelnye aspekty, URSS, Librokom, M., 2011