ConceptTheory & Algos
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.
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
1Erik Demaine
Connections
7The lectures that define it or assume it, and the concepts next to it.