ConceptTheory & Algos
P vs NP
P is the class of problems with efficient algorithms to find solutions, while NP is the class of problems where proposed solutions can be verified efficiently.
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.
Complexity classes1Verification vs solving1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
5Connections
11The lectures that define it or assume it, and the concepts next to it.