Subset sum and the secret language of numbers
Kent Quanrud · 66:58
Subset sum looks like a simple “pick numbers that add to a target” problem and even has an \(O(nT)\) DP, but that is not polynomial in the input size; the lecture then shows a poly-time algorithm for subset sum would...