ON THE COMPLEXITY OF COMPUTING PRIME TABLES ON THE TURING MACHINE
From MaRDI portal
Publication:5150729
DOI10.17223/20710410/31/8zbMath1467.68071arXiv1604.01154OpenAlexW2963994509MaRDI QIDQ5150729
Publication date: 15 February 2021
Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.01154
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Primes (11A41) Classical models of computation (Turing machines, etc.) (68Q04)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate formulas for some functions of prime numbers
- Handbook of Number Theory I
- On the Complexity of Computing Prime Tables
- A sublinear additive sieve for finding prime number
- Some new upper bounds on the generation of prime numbers
- Prime sieves using binary quadratic forms
- How Fast Can We Multiply Large Integers on an Actual Computer?