Adleman–Pomerance–Rumely primality test
E199750
UNEXPLORED
The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
Referenced by (1)
| Subject (surface form when different) | Predicate |
|---|---|
|
Leonard Adleman
→
|
knownFor |