gptkbp:instance_of
|
gptkb:Artificial_Intelligence
|
gptkbp:analyzes
|
grid of numbers
|
gptkbp:can_be_extended_by
|
gptkb:sieve_of_Atkin
|
gptkbp:designed_by
|
gptkb:Eratosthenes
|
gptkbp:features_works_by
|
iterative marking
|
gptkbp:first_published
|
circa 200 BC
|
gptkbp:has_programs
|
number theory
|
gptkbp:historical_event
|
yes
|
https://www.w3.org/2000/01/rdf-schema#label
|
sieve of Eratosthenes
|
gptkbp:improves
|
trial division
|
gptkbp:input_output
|
positive integers
list of prime numbers
|
gptkbp:is
|
a recursive algorithm
a probabilistic algorithm
|
gptkbp:is_a
|
gptkb:Artificial_Intelligence
deterministic algorithm
|
gptkbp:is_based_on
|
elimination of non-prime numbers
|
gptkbp:is_considered
|
a classic algorithm
a fundamental algorithm in number theory
one of the oldest algorithms
|
gptkbp:is_described_as
|
gptkb:textbooks
|
gptkbp:is_effective_against
|
finding all primes up to a given limit
large ranges of numbers
|
gptkbp:is_implemented_in
|
gptkb:C_programming_language
gptkb:Ruby
gptkb:Java
gptkb:C++
gptkb:Python
gptkb:Java_Script
software libraries
|
gptkbp:is_optimized_for
|
segmented sieve
|
gptkbp:is_part_of
|
mathematical history
|
gptkbp:is_popular_in
|
gptkb:computer_science
|
gptkbp:is_recognized_by
|
mathematicians worldwide
|
gptkbp:is_related_to
|
gptkb:Euler's_totient_function
combinatorial number theory
|
gptkbp:is_taught_in
|
mathematics courses
|
gptkbp:is_used_by
|
gptkb:Mathematician
|
gptkbp:is_used_in
|
gptkb:crypt
mathematical research
algorithm competitions
|
gptkbp:marks_multiples_of
|
each prime number
|
gptkbp:originated_in
|
gptkb:ancient_Greece
|
gptkbp:related_to
|
gptkb:prime_factorization
|
gptkbp:requires
|
boolean array
|
gptkbp:space_complexity
|
O(n)
|
gptkbp:suitable_for
|
very large numbers without optimization
|
gptkbp:time_complexity
|
O(n log log n)
|
gptkbp:used_for
|
finding prime numbers
|
gptkbp:was_a_demonstration_of
|
gptkb:educational_content
|
gptkbp:bfsParent
|
gptkb:Carl_Friedrich_Gauss
|
gptkbp:bfsLayer
|
4
|