ConceptTheory & Algos
Polynomial-time (P)
An efficient algorithm whose running time is bounded by a polynomial in the size of the 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.
Algorithm1Input size1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
1Connections
4The lectures that define it or assume it, and the concepts next to it.