A sublinear additive sieve for finding prime number
From MaRDI portal
Publication:3902523
DOI10.1145/358527.358540zbMath0454.68084MaRDI QIDQ3902523
Publication date: 1981
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/358527.358540
68W30: Symbolic computation and algebraic computation
11Y16: Number-theoretic algorithms; complexity
11A41: Primes
11Y11: Primality
Related Items
Approximating the number of integers free of large prime factors, An estimate for the number of integers without large prime factors, Prime sieves using binary quadratic forms, A space-efficient fast prime number sieve, An incremental primal sieve, Factoring polynomials with rational coefficients, A probabilistic algorithm for verifying matrix products using \(O(n^ 2)\) time and \(\log_ 2n+O(1)\) random bits, Iterated Absolute Values of Differences of Consecutive Primes, On Faster Integer Calculations Using Non-arithmetic Primitives