ConceptTheory & Algos
P versus NP problem
A major unresolved question in computer science and mathematics concerning whether every problem whose solution can be verified quickly can also be solved quickly.
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
1Lectures that assume it
5Connections
13The lectures that define it or assume it, and the concepts next to it.