A linear sieve algorithm for finding prime numbers
From MaRDI portal
Publication:4168065
DOI10.1145/359657.359660zbMath0387.68030WikidataQ56112620 ScholiaQ56112620MaRDI QIDQ4168065
Publication date: 1978
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6407
68Q25: Analysis of algorithms and problem complexity
11A41: Primes
68W99: Algorithms in computer science
Related Items
DENSITY AND DISTRIBUTION OF PRIMES, Fast algorithms for abelian periods in words and greatest common divisor queries, A space-efficient fast prime number sieve, An incremental primal sieve, Space-time trade off in implementing certain set operations