New prime enumeration algorithms achieve N (log log N)^{1+o(1)} bit operations in the multitape Turing model, improving prior work by nearly log N via fast polynomial arithmetic over finite fields and error-correcting code ideas.
Cambridge University Press, Cambridge, 2011, pp
1 Pith paper cite this work, alongside 187 external citations. Polarity classification is still indexing.
1
Pith paper citing it
187
external citations · OpenAlex
fields
math.NT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Faster enumeration of primes
New prime enumeration algorithms achieve N (log log N)^{1+o(1)} bit operations in the multitape Turing model, improving prior work by nearly log N via fast polynomial arithmetic over finite fields and error-correcting code ideas.