Explaining the wheel sieve

DOI10.1007/BF00264164zbMath0478.10006OpenAlexW2039185199MaRDI QIDQ1160644

Paul A. Pritchard

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264164

zbMATH Keywords

algorithmprime numberssublinear additive sievewheel sieve

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Applications of sieve methods (11N36) Primes (11A41)

Related Items

Faster sparse multivariate polynomial interpolation of straight-line programs ⋮ Three Cousins of Recaman's Sequence ⋮ 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¹⁸ ⋮ Prime sieves using binary quadratic forms

This page was built for publication: Explaining the wheel sieve