Fast compact prime number sieves (among others)

DOI10.1016/0196-6774(83)90014-7zbMath0546.10004OpenAlexW2004203774MaRDI QIDQ3337529

Paul A. Pritchard

Publication date: 1983

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6313

zbMATH Keywords

primescomplexitynumerical resultsfast algorithmsstoragetimecomputational number theorySieving methods

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Primes (11A41) Primality (11Y11)

Related Items (9)

Sieve algorithms for perfect power testing ⋮ Two compact incremental prime sieves ⋮ A space-efficient fast prime number sieve ⋮ Iterated Absolute Values of Differences of Consecutive Primes ⋮ Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸ ⋮ Detecting perfect powers in essentially linear time ⋮ Prime sieves using binary quadratic forms ⋮ Results and estimates on pseudopowers ⋮ An improved sieve of Eratosthenes

This page was built for publication: Fast compact prime number sieves (among others)