Blog name changed…
by Edward Z. Yang
...because I don’t live in a room numbered 245s anymore. Yep. :-)
This is a cow. They munch grass next to the River Cam.
Pop quiz. What do matrix-chain multiplication, longest common subsequence, construction of optimal binary search trees, bitonic euclidean traveling-salesman, edit distance and the Viterbi algorithm have in common?
Did you enjoy this post? Please subscribe to my feed!
You can find an optimum using dynamic programming?
Man, and I thought there was some significance to “245 seconds”. Wrong!
Oh, I know this one! They are all computable!
They’re CS concepts!
What do they have in common?
It’s dynamic programming. :-)