ConceptTheory & Algos
The complexity class of all languages solvable in polynomial time by a Turing machine equipped with a SAT oracle.
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
5The lectures that define it or assume it, and the concepts next to it.