Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Generating_primes> ?p ?o. }
Showing items 1 to 38 of
38
with 100 items per page.
- Generating_primes abstract "In computational number theory, a variety of algorithms make it possible to generate prime numbers efficiently. These are used in various applications, for example hashing, public-key cryptography, and search of prime factors in large numbers.For relatively small numbers, it is possible to just apply trial division to each successive odd number. Prime sieves are almost always faster.".
- Generating_primes wikiPageExternalLink 132206.html.
- Generating_primes wikiPageExternalLink summary?doi=10.1.1.52.835.
- Generating_primes wikiPageExternalLink primesieves-19990826.pdf.
- Generating_primes wikiPageExternalLink S0025-5718-03-01501-1.pdf.
- Generating_primes wikiPageID "2515826".
- Generating_primes wikiPageRevisionID "598964218".
- Generating_primes hasPhotoCollection Generating_primes.
- Generating_primes subject Category:Cryptographic_algorithms.
- Generating_primes subject Category:Number_theoretic_algorithms.
- Generating_primes subject Category:Prime_numbers.
- Generating_primes type Abstraction100002137.
- Generating_primes type Act100030358.
- Generating_primes type Activity100407535.
- Generating_primes type Algorithm105847438.
- Generating_primes type CryptographicAlgorithms.
- Generating_primes type DefiniteQuantity113576101.
- Generating_primes type Event100029378.
- Generating_primes type Measure100033615.
- Generating_primes type Number113582013.
- Generating_primes type NumberTheoreticAlgorithms.
- Generating_primes type Prime113594005.
- Generating_primes type PrimeNumber113594302.
- Generating_primes type PrimeNumbers.
- Generating_primes type Procedure101023820.
- Generating_primes type PsychologicalFeature100023100.
- Generating_primes type Rule105846932.
- Generating_primes type YagoPermanentlyLocatedEntity.
- Generating_primes comment "In computational number theory, a variety of algorithms make it possible to generate prime numbers efficiently. These are used in various applications, for example hashing, public-key cryptography, and search of prime factors in large numbers.For relatively small numbers, it is possible to just apply trial division to each successive odd number. Prime sieves are almost always faster.".
- Generating_primes label "Generating primes".
- Generating_primes label "Случайное простое число".
- Generating_primes label "توليد الأعداد الأولية".
- Generating_primes sameAs m.07k86w.
- Generating_primes sameAs Q4116925.
- Generating_primes sameAs Q4116925.
- Generating_primes sameAs Generating_primes.
- Generating_primes wasDerivedFrom Generating_primes?oldid=598964218.
- Generating_primes isPrimaryTopicOf Generating_primes.