A space-efficient fast prime number sieve

We present a new algorithm that finds all primes up to n using at most O( n log log n ) arithmetic operations and O( n (log n log log n) ) space. This algorithm is an improvement of a linear prime number sieve due to Pritchard. Our new algorithm matches the running time of the best previous prime nu...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information processing letters Ročník 59; číslo 2; s. 79 - 84
Hlavní autori:	Dunten, Brian, Jones, Julie, Sorenson, Jonathan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 22.07.1996 Elsevier Science Elsevier Sequoia S.A
Predmet:	Algebra Algorithmics. Computability. Computer arithmetics Algorithms Analysis of algorithms Applied sciences Computer science; control theory; systems Design of algorithms Exact sciences and technology Information processing Mathematical analysis Mathematics Number theoretic algorithms Number theory Prime number sieve Prime numbers Sciences and techniques of general use Sieve of Eratosthenes Studies Theoretical computing Design of algorithms Analysis of algorithms Prime number sieve Sieve of Eratosthenes Number theoretic algorithms Algorithms Arithmetic operation Eratosthène sieve Algorithm analysis Prime number
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!