ConceptSystems & CS
Polynomial complexity
Polynomial complexity generally deals with functions that have nested loops or recursive function calls, commonly growing quadratically with the input size.
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.
Lecturers
1Connections
5The lectures that define it or assume it, and the concepts next to it.