ConceptTheory & Algos
Dichotomy theorem
A theorem stating that every problem in a complexity class falls into one of two disjoint categories, such as being in P or NP-complete.
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.