Adleman–Pomerance–Rumely primality test
GPTKB entity
Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:primality_test
|
| gptkbp:alsoKnownAs |
APR test
|
| gptkbp:complexity |
quasi-polynomial time
|
| gptkbp:field |
computational mathematics
number theory |
| gptkbp:generalizes |
gptkb:Cohen–Lenstra_primality_test
|
| gptkbp:heldBy |
polynomial-time algorithm (under certain assumptions)
deterministic primality test |
| gptkbp:introducedIn |
1983
|
| gptkbp:namedAfter |
gptkb:Leonard_Adleman
gptkb:Robert_Rumely gptkb:Carl_Pomerance |
| gptkbp:relatedTo |
gptkb:AKS_primality_test
|
| gptkbp:significance |
first general-purpose primality-proving algorithm faster than previous methods
|
| gptkbp:usedFor |
testing whether a number is prime
|
| gptkbp:bfsParent |
gptkb:Leonard_Adleman
|
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
Adleman–Pomerance–Rumely primality test
|