Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:assumes |
gptkb:Extended_Riemann_Hypothesis
|
| gptkbp:complexity |
deterministic polynomial time (under ERH)
|
| gptkbp:field |
number theory
|
| gptkbp:input |
odd integer n > 2
|
| gptkbp:notableFor |
first polynomial-time primality test under ERH
|
| gptkbp:output |
prime or composite decision
|
| gptkbp:proposedBy |
gptkb:Gary_L._Miller
|
| gptkbp:relatedTo |
gptkb:Miller–Rabin_primality_test
|
| gptkbp:usedFor |
primality testing
|
| gptkbp:yearProposed |
1976
|
| gptkbp:bfsParent |
gptkb:Tate_pairing
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Miller's algorithm
|