Sign inSign in

Deterministic primality testing

An algorithm that determines whether an n-bit number is prime without any randomness, taking O~(n6)\tilde{O}(n^6) steps in its best known form.
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.

Algorithm complexity1Prime number1

Lecturers

1

    Connections

    2

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

    Concept1

    Lecture1

    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.