Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01151596n
Noun Concept
Categories: Articles with short description, Primality tests, Finite fields
EN
Miller–Rabin primality test  Rabin-Miller strong pseudoprime test  Miller-Rabin  Miller-Rabin algorithm  Miller-Rabin primality test
EN
The Miller–Rabin primality test or Rabin–Miller primality test is a probabilistic primality test: an algorithm which determines whether a given number is likely to be prime, similar to the Fermat primality test and the Solovay–Strassen primality test. Wikipedia
Definitions
Relations
Sources
EN
The Miller–Rabin primality test or Rabin–Miller primality test is a probabilistic primality test: an algorithm which determines whether a given number is likely to be prime, similar to the Fermat primality test and the Solovay–Strassen primality test. Wikipedia
Probabilistic primality test Wikidata
IS A
primality test
NAMED AFTER
Gary Miller
Michael O. Rabin
Wikipedia
EN
Miller–Rabin primality test
Wikidata
EN
Miller–Rabin primality test
Wikipedia Redirections
EN
Miller-Rabin, Miller-Rabin algorithm, Miller-Rabin primality test, Miller-Rabin prime test, Miller-Rabin probabilistic primality test, Miller-Rabin test, Miller rabin, Miller–Rabin test, Rabin's primality test, Rabin-Miller, Rabin-Miller primality test, Rabin-Miller strong pseudoprime test, Rabin-miller strong pseudoprime test, Rabin-Miller test, Rabin miller, strong liar, strong witness
Wikidata Alias
EN
Miller-Rabin algorithm, Rabin–Miller primality test

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