Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03699489n
Noun Concept
JA
APR判定法  Adleman–Pomerance–Rumelyによる素数判定法
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
アルゴリズム
素数判定
NAMED AFTER
カール・ポメランス
レオナルド・エーデルマン
ロバート・ルメリー
Wikidata
JA
APR判定法
Wikidata Alias
JA
Adleman–Pomerance–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