Sign inSign in

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.
Watch it explained

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

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.