Abstract
We prove that the complexity of computing the table of primes between $1$ and $n$ on a multitape Turing machine is $O(n \log n)$.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
