Sign inSign in

Composites

The decision problem of determining whether a given natural number is composite (not prime and greater than 1).
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

    The language consisting of all non-prime integers represented in binary.
    • 25:55P and NP, SAT, Poly-Time Reducibility

Lectures that assume it

2

Connections

10

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

2 lecturers. 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.