ConceptTheory & Algos
Weak NP-hardness
A problem is weakly NP-hard if it is NP-hard, but has a pseudo-polynomial time algorithm, meaning it can be solved in polynomial time if the numerical values involved are bounded polynomially.
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.
NP-hardness1Pseudo-polynomial time1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.