Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03699489n
Noun Concept
SYL
No term available
EN
In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Wikipedia
Relations
Sources
IS A
EN
algorithm
EN
primality test
NAMED AFTER
Carl Pomerance
Leonard adleman
EN
Robert Rumely

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License