ConceptTheory & Algos
Memoized DP algorithm running time analysis
The running time of a memoized algorithm is bounded by the product of the number of nonmemoized calls and the constant nonrecursive work per call.
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
1Connections
4The lectures that define it or assume it, and the concepts next to it.