Sign inSign in

Time complexity

The total time required for an algorithm to complete its execution in the worst case.
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.

Decider algorithm1Message complexity1Network delay bounds1Turing machine1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A function mapping natural numbers to natural numbers that gives the maximum number of steps a decider algorithm takes on any input of a given length.
    • 4:43Simulations and Turing Machine Variants

Lectures that assume it

35

The first 12 are shown.

Connections

44

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

Concepts7

Show 1 more

Lectures37

Show 31 more

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.