Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7252277> ?p ?o }
Showing triples 1 to 16 of
16
with 100 triples per page.
- Q7252277 subject Q7012332.
- Q7252277 abstract "In number theory, a provable prime is an integer that has been calculated to be prime using a primality-proving algorithm. Contrast with probable prime, which is likely (but not certain) to be prime, based on the output of a probabilistic primality test. In principle, every prime number can be proved to be prime in polynomial time by using the AKS primality test. In practice, other methods which guarantee that their result is prime, but which do not work for all primes, are useful for the random generation of provable primes.".
- Q7252277 wikiPageWikiLink Q12479.
- Q7252277 wikiPageWikiLink Q12503.
- Q7252277 wikiPageWikiLink Q2393193.
- Q7252277 wikiPageWikiLink Q2654835.
- Q7252277 wikiPageWikiLink Q294284.
- Q7252277 wikiPageWikiLink Q49008.
- Q7252277 wikiPageWikiLink Q583461.
- Q7252277 wikiPageWikiLink Q7012332.
- Q7252277 wikiPageWikiLink Q829546.
- Q7252277 wikiPageWikiLink Q8366.
- Q7252277 type Thing.
- Q7252277 comment "In number theory, a provable prime is an integer that has been calculated to be prime using a primality-proving algorithm. Contrast with probable prime, which is likely (but not certain) to be prime, based on the output of a probabilistic primality test. In principle, every prime number can be proved to be prime in polynomial time by using the AKS primality test.".
- Q7252277 label "Provable prime".
- Q7252277 differentFrom Q2654835.