ConceptTheory & Algos
P versus NP
The fundamental open question in computer science asking whether every problem whose solution can be quickly verified can also be quickly solved.
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
7Connections
15The lectures that define it or assume it, and the concepts next to it.
Concepts7
- NP
- P
- Dichotomy theorem
- Hardness versus randomness
- Importance of NP-completeness
- Intermediate problems between P and NP-complete