Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6518927> ?p ?o }
Showing triples 1 to 16 of
16
with 100 triples per page.
- Q6518927 subject Q7019670.
- Q6518927 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.".
- Q6518927 wikiPageExternalLink node11.html.
- Q6518927 wikiPageWikiLink Q1200338.
- Q6518927 wikiPageWikiLink Q13107493.
- Q6518927 wikiPageWikiLink Q131752.
- Q6518927 wikiPageWikiLink Q16873249.
- Q6518927 wikiPageWikiLink Q17457.
- Q6518927 wikiPageWikiLink Q193794.
- Q6518927 wikiPageWikiLink Q230848.
- Q6518927 wikiPageWikiLink Q44337.
- Q6518927 wikiPageWikiLink Q7019670.
- Q6518927 wikiPageWikiLink Q8366.
- Q6518927 wikiPageWikiLink Q843684.
- Q6518927 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.".
- Q6518927 label "Lehmer's GCD algorithm".