ConceptTheory & Algos
Verifier based definition of NP
The characterization of NP as the class of languages decidable by a polynomial-time verifier.
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
3The lectures that define it or assume it, and the concepts next to it.