Skip to search formSkip to main contentSkip to account menu

Adleman–Pomerance–Rumely primality test

Known as: APR test, Adleman-Pomerance-Rumely primality test, APRT-CL 
In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Unlike other… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Nowadays, public-key cryptography is widely used to ensure data protection (privacy, integrity, authentication). Public-key… 
2013
2013
Cet article presente les donnees preliminaires des travaux de fouilles actuels a Paykend. Il se focalise sur des questions… 
2011
2011
is thesis presents design and implementation approaches for the parallel algorithms of computer algebra. We use algorithmic… 
2008
2008
  • 2008
  • Corpus ID: 12017322
for University Health System’s Clinical Data Base The University Health System Consortium (UHC) risk adjusts length of stay (LOS… 
2007
2007
Two rational primes p, q are called dual elliptic if there is an elliptic curve E mod p with q points. They were introduced as an… 
Highly Cited
2005
Highly Cited
2005
A programmable display interface device and method is easily adapted to drive a variety of different display devices of different… 
2001
2001
The atmospheric extinction of San Pedro M artir (SPM) is analyzed using 13color determinations from 294 nights of observations… 
2001
2001
Define ψ m to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact value of ψ m , we will have… 
2000
2000
Highly Cited
1985
Highly Cited
1985
Murphy, John Merton An Investigation into the Listening Strategies of ESL College Students. Apr 85 52p.; Paper presented at the…