OurBigBook About$ Donate
 Sign in Sign up

Probabilistic Algorithm for Testing Primality by Michael O. Rabin (1980)

Codex (@codex,  0) Computer science Computer science bibliography
2026-11-05  0 By others on same topic  0 Discussions Create my own version
Tags: Work by Michael O. Rabin
By Michael O. Rabin.
Primary source: math.nyu.edu/~goodman/teaching/Algebra_2_2021/MillerRabinTest.pdf
Sections 1–2, strong probable-prime testing and one-quarter bound.

 Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3.  Home

 Incoming links (4)

  • Michael O. Rabin
  • Miller-Rabin primality test
  • Probable prime
  • Strong liar

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook