Sign inSign in

Pseudo-polynomial time

An algorithm whose running time is polynomial in the numeric value of the input, but exponential in the number of bits used to represent that input.
as Erik Demaine defines itMITThe wording closest to all 3 definitions
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

1
  • Erik Demaine

    MIT · Undergraduate

    • 51:27Dynamic Programming III: Parenthesization, Edit Distance, Knapsack
    • 1:09:05Complexity: P, NP, NP-completeness, Reductions

Connections

7

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

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.