Geodesic
On the complexity of computing prime tables on the Turing machine
Prikladnaâ diskretnaâ matematika, no. 1 (2016), pp. 86-91

Voir la notice de l'article provenant de la source Math-Net.Ru

It is proved that the complexity of computing the table of primes up to $n$ on a multitape Turing machine is O$(n\log n)$.
Keywords: Turing machine, complexity, sieving. 
@article{PDM_2016_1_a7,
     author = {I. S. Sergeev},
     title = {On the complexity of computing prime tables on the {Turing} machine},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {86--91},
     publisher = {mathdoc},
     number = {1},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2016_1_a7/}
}
TY  - JOUR
AU  - I. S. Sergeev
TI  - On the complexity of computing prime tables on the Turing machine
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2016
SP  - 86
EP  - 91
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2016_1_a7/
LA  - ru
ID  - PDM_2016_1_a7
ER  - 
%0 Journal Article
%A I. S. Sergeev
%T On the complexity of computing prime tables on the Turing machine
%J Prikladnaâ diskretnaâ matematika
%D 2016
%P 86-91
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2016_1_a7/
%G ru
%F PDM_2016_1_a7
I. S. Sergeev. On the complexity of computing prime tables on the Turing machine. Prikladnaâ diskretnaâ matematika, no. 1 (2016), pp. 86-91. http://geodesic.mathdoc.fr/item/PDM_2016_1_a7/