3 ms·
It looks like everything after dynamic programming in 2007 is missing the video, including the lecture where he builds a proof of NP-hardness from a randomly se
by krakensden 18y ago
It looks like everything after dynamic programming in 2007 is missing the video, including the lecture where he builds a proof of NP-hardness from a randomly selected problem in class.
/That/ is something I'd like to watch!
- bkudria 18y agoI was there - but I don't remember the problem we chose. Sorry. But is was cool.