Adleman–Pomerance–Rumely primality test
0 sources
Summary
Adleman–Pomerance–Rumely primality test is an algorithm[1]. It draws 25 Wikipedia views per month (algorithm category, ranking #129 of 337).[2]
Key Facts
- Adleman–Pomerance–Rumely primality test's instance of is recorded as algorithm[3].
- Adleman–Pomerance–Rumely primality test's instance of is recorded as primality test[4].
- Leonard Adleman is named after Adleman–Pomerance–Rumely primality test[5].
- Carl Pomerance is named after Adleman–Pomerance–Rumely primality test[6].
- Robert Rumely is named after Adleman–Pomerance–Rumely primality test[7].
- Adleman–Pomerance–Rumely primality test's Freebase ID is recorded as /m/026vx13[8].
- Adleman–Pomerance–Rumely primality test's Microsoft Academic ID is recorded as 2776340056[9].
Body
Designation and Status
Recorded instance of include algorithm[3] and primality test[4].
History and Context
Things named after include Leonard Adleman[5], a computer scientist[10], b. 1945[11], of United States[12], awarded the Turing Award[13], specialised in cryptography[14]; Carl Pomerance[6], a mathematician[15], b. 1944[16], of United States[17], awarded the Fellow of the American Mathematical Society[18], specialised in number theory[19]; and Robert Rumely[7], a mathematician[20], b. 1952[21], of United States[22], awarded the Fellow of the American Mathematical Society[23].
Why It Matters
Adleman–Pomerance–Rumely primality test draws 25 Wikipedia views per month (algorithm category, ranking #129 of 337).[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[24] It is known by 5 alternative names across languages and contexts.[25]