ConceptTheory & Algos
Algorithmic hardness
The study of whether a problem can be solved by an efficient polynomial-time algorithm.
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.
Complexity classes1Polynomial time1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.