ConceptTheory & Algos
Strong NP-hardness
A problem is strongly NP-hard if it is NP-hard even when the numbers in the input are bounded by a polynomial in the input size rather than being exponentially large.
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.