Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Prikladnaya Diskretnaya Matematika, 2016, Number 1(31), Pages 86–91
DOI: https://doi.org/10.17223/20710410/31/8 (Mi pdm536) 		 
Computational Methods in Discrete Mathematics

On the complexity of computing prime tables on the Turing machine

I. S. Sergeev

Technology Federal State Unitary Enterprise "Research Institute Kvant", Moscow, Russia
Full-text PDF (645 kB)
References:
PDF
HTML
DOI: https://doi.org/10.17223/20710410/31/8
Abstract: 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.
Funding agency Grant number
Russian Foundation for Basic Research 14-01-00671а
Bibliographic databases:
Document Type: Article
UDC: 519.71
Language: Russian
Citation: I. S. Sergeev, “On the complexity of computing prime tables on the Turing machine”, Prikl. Diskr. Mat., 2016, no. 1(31), 86–91
Citation in format AMSBIB
\Bibitem{Ser16}
\by I.~S.~Sergeev
\paper On the complexity of computing prime tables on the Turing machine
\jour Prikl. Diskr. Mat.
\yr 2016
\issue 1(31)
\pages 86--91
\mathnet{http://mi.mathnet.ru/pdm536}
\crossref{https://doi.org/10.17223/20710410/31/8}
Linking options:
  • https://www.mathnet.ru/eng/pdm536
  • https://www.mathnet.ru/eng/pdm/y2016/i1/p86
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025