ConceptSystems & CS
NP-complete problems
A class of problems for which a proposed solution can be checked quickly, but finding a solution requires exponential time.
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
2Each in their own terms, from the easiest level.
Brian Yu
Problems for which there is no known efficient way to find an optimal solution.
Lectures that assume it
2Connections
7The lectures that define it or assume it, and the concepts next to it.