Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Lehmer's_GCD_algorithm> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- Lehmer's_GCD_algorithm abstract "Lehmer's GCD algorithm, named after Derrick Henry Lehmer, is a fast GCD algorithm, an improvement on the simpler but slower Euclidean algorithm. It is mainly used for big integers that have a representation as a string of digits relative to some chosen numeral system base, say β = 1000 or β = 232.".
- Lehmer's_GCD_algorithm wikiPageExternalLink node11.html.
- Lehmer's_GCD_algorithm wikiPageID "8547944".
- Lehmer's_GCD_algorithm wikiPageRevisionID "549444791".
- Lehmer's_GCD_algorithm hasPhotoCollection Lehmer's_GCD_algorithm.
- Lehmer's_GCD_algorithm subject Category:Number_theoretic_algorithms.
- Lehmer's_GCD_algorithm type Abstraction100002137.
- Lehmer's_GCD_algorithm type Act100030358.
- Lehmer's_GCD_algorithm type Activity100407535.
- Lehmer's_GCD_algorithm type Algorithm105847438.
- Lehmer's_GCD_algorithm type Event100029378.
- Lehmer's_GCD_algorithm type NumberTheoreticAlgorithms.
- Lehmer's_GCD_algorithm type Procedure101023820.
- Lehmer's_GCD_algorithm type PsychologicalFeature100023100.
- Lehmer's_GCD_algorithm type Rule105846932.
- Lehmer's_GCD_algorithm type YagoPermanentlyLocatedEntity.
- Lehmer's_GCD_algorithm comment "Lehmer's GCD algorithm, named after Derrick Henry Lehmer, is a fast GCD algorithm, an improvement on the simpler but slower Euclidean algorithm. It is mainly used for big integers that have a representation as a string of digits relative to some chosen numeral system base, say β = 1000 or β = 232.".
- Lehmer's_GCD_algorithm label "Lehmer's GCD algorithm".
- Lehmer's_GCD_algorithm sameAs m.0277gs0.
- Lehmer's_GCD_algorithm sameAs Q6518927.
- Lehmer's_GCD_algorithm sameAs Q6518927.
- Lehmer's_GCD_algorithm sameAs Lehmer's_GCD_algorithm.
- Lehmer's_GCD_algorithm wasDerivedFrom Lehmer's_GCD_algorithm?oldid=549444791.
- Lehmer's_GCD_algorithm isPrimaryTopicOf Lehmer's_GCD_algorithm.