The sieve of Atkin is a modern algorithm, created in 2003 by A.O.L. Atkin and Daniel Bernstein, for finding all prime numbers up to a specified integer. Compared with the ancient sieve of Eratosthenes, which marks off multiples of primes, the sieve of Atkin does preliminary work and then marks off multiples of squares of primes, achieving a better theoretical asymptotic complexity.
Facts
Time Complexity
Time Complexity (category) Connections
In Field
Source Sieve of Atkin (Wikipedia)
Preceded By
Verified en.wikipedia.org/wiki/Sieve_of_Atkin: "Compared with the ancient sieve of Eratosthenes, which marks off multiples of primes, the sieve of Atkin does some preliminary work and then marks off multiples of squares of primes, thus achieving a better theoretical asymptotic complexity."
Sources
1. Wikidata: Sieve of Atkin
Wikidata Q1542201, class allow-list match (w-wdresolver-0926)View the Source Sieve of Atkin (Wikipedia)
In Field: Algorithms and Complexity Theory, Lead sentenceQuote, In Field: Algorithms and Complexity Theory, Lead sentence
sieve of Atkin is a modern algorithm for finding all prime numbers up to a specified integer.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.