Sign inSign in

Miller-Rabin algorithm

A probabilistic primality test that runs in roughly n2n^2 steps without relying on the Extended Riemann Hypothesis.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 10:07Primes and Prime Fields

Connections

5

The lectures that define it or assume it, and the concepts next to it.

Concepts3

Lectures2

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.