Timeline for What is dynamic programming about?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 17, 2015 at 7:18 | comment | added | Kittsil | @Ben I didn't say it was a one-to-one trade. You can prune a recurrence tree as well. I posit that I did answer the question, which was, "What does DP get us?" It gets us faster algorithms by trading space for time. I agree that the accepted answer is more thorough, but this is valid as well. | |
| Sep 16, 2015 at 20:12 | comment | added | Ben Voigt | @trueshot: Except that sometimes dynamic programming (and particularly, "Pruned Dynamic Programming") is able to reduce both time and space requirements. | |
| Sep 16, 2015 at 17:04 | comment | added | trueshot | "Dynamic Programming allows you to trade memory for computation time" is not something I heard when doing undergrad, and it's a great way to look at this subject. This is an intuitive answer with a succinct example. | |
| Sep 16, 2015 at 7:03 | comment | added | Raphael | You talk only about the memoization part, which misses the point of the question. | |
| Sep 15, 2015 at 20:12 | history | answered | Kittsil | CC BY-SA 3.0 |