Some new upper bounds on the generation of prime numbers

DOI10.1145/359810.359838zbMath0355.68040OpenAlexW1981552827MaRDI QIDQ4127386

Harry G. Mairson

Publication date: 1977

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359810.359838

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Primes (11A41)

Related Items (4)

An incremental primal sieve ⋮ Linear time algorithms for Abelian group isomorphism and related problems ⋮ DENSITY AND DISTRIBUTION OF PRIMES ⋮ ON THE COMPLEXITY OF COMPUTING PRIME TABLES ON THE TURING MACHINE

This page was built for publication: Some new upper bounds on the generation of prime numbers