This HTML5 document contains 1 embedded RDF statements represented using HTML+Microdata notation.
The embedded RDF content will be recognized by any processor of HTML5 Microdata.
| Prefix | Namespace IRI |
|---|
| rdfs | http://www.w3.org/2000/01/rdf-schema# |
| rdf | http://www.w3.org/1999/02/22-rdf-syntax-ns# |
| xsdh | http://www.w3.org/2001/XMLSchema# |
| dbpedia | http://dbpedia.org/resource/ |
- Subject Item
- dbpedia:MillerâRabin_primality_test
- rdfs:comment
-
The Miller–Rabin primality test or Rabin–Miller primality test is a primality test: an algorithm which determines whether a given number is prime, similar to the Fermat primality test and the Solovay–Strassen primality test. Its original version, due to Gary L. Miller, is deterministic, but the determinism relies on the unproven Extended Riemann hypothesis; Michael O. Rabin modified it to obtain an unconditional probabilistic algorithm.