Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03699489n
Noun Concept
Categories: Algorithms and data structures stubs, Number theory stubs, Primality tests
EN
Adleman–Pomerance–Rumely primality test  Adleman-Pomerance-Rumely primality test  Adleman-Rumely primality test  APR-CL  APR primality test
EN
In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Wikipedia
Definitions
Relations
Sources
EN
In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Wikipedia
Algorithm for determining whether a number is prime Wikidata
IS A
algorithm
primality test
NAMED AFTER
Carl Pomerance
Leonard Adleman
Robert Rumely
Wikipedia
EN
Adleman–Pomerance–Rumely primality test
Wikidata
EN
Adleman–Pomerance–Rumely primality test
Wikipedia Redirections
EN
Adleman-Pomerance-Rumely primality test, Adleman-Rumely primality test, APR-CL, APR primality test, APR test, APRCL, APRT-CL
Wikidata Alias
EN
APRT-CL

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