Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Provable_prime> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- Provable_prime abstract "In number theory, a provable prime is an integer that is 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 algorithm. There are algorithms that prove the primality of an integer. AKS primality testing is such an algorithm with polynomial running time.".
- Provable_prime wikiPageID "2549312".
- Provable_prime wikiPageRevisionID "420892555".
- Provable_prime hasPhotoCollection Provable_prime.
- Provable_prime subject Category:Primality_tests.
- Provable_prime type Abstraction100002137.
- Provable_prime type Cognition100023271.
- Provable_prime type Experiment105798043.
- Provable_prime type HigherCognitiveProcess105770664.
- Provable_prime type Inquiry105797597.
- Provable_prime type PrimalityTests.
- Provable_prime type ProblemSolving105796750.
- Provable_prime type Process105701363.
- Provable_prime type PsychologicalFeature100023100.
- Provable_prime type Thinking105770926.
- Provable_prime type Trial105799212.
- Provable_prime comment "In number theory, a provable prime is an integer that is 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 algorithm. There are algorithms that prove the primality of an integer. AKS primality testing is such an algorithm with polynomial running time.".
- Provable_prime label "Provable prime".
- Provable_prime sameAs m.07mfkv.
- Provable_prime sameAs Q7252277.
- Provable_prime sameAs Q7252277.
- Provable_prime sameAs Provable_prime.
- Provable_prime wasDerivedFrom Provable_prime?oldid=420892555.
- Provable_prime isPrimaryTopicOf Provable_prime.