• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Sieve of Atkin     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatPrimeNumbers, within Data Space : dbpedia.org associated with source document(s)

Type: softwareyago:WikicatNumberTheoreticAlgorithmsyago:Abstraction100002137yago:Act100030358yago:Activity100407535yago:Algorithm105847438yago:Cognition100023271yago:DefiniteQuantity113576101yago:Event100029378yago:Experiment105798043yago:HigherCognitiveProcess105770664yago:Inquiry105797597yago:Measure100033615yago:Number113582013yago:Prime113594005yago:PrimeNumber113594302yago:ProblemSolving105796750yago:Procedure101023820yago:Process105701363yago:PsychologicalFeature100023100yago:YagoPermanentlyLocatedEntityyago:Rule105846932yago:Thinking105770926yago:Trial105799212yago:WikicatPrimalityTestsyago:WikicatPrimeNumbers New Facet based on Instances of this Class

In mathematics, the sieve of Atkin is a modern algorithm 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 some preliminary work and then marks off multiples of squares of primes, thus achieving a better theoretical asymptotic complexity. It was created in 2003 by A. O. L. Atkin and Daniel J. Bernstein.