ConceptTheory & Algos
Class NP
The class of decision problems for which a yes answer can be checked in polynomial time given a proof.
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
1Connections
4The lectures that define it or assume it, and the concepts next to it.