On the positive side, it should be stressed that not all DP algorithms are
cursed: there are many DP algorithms that are polynomial in time and space
(e.g. DP algorithms for the shortest path problem). Furthermore, many DP
functional equations can be solved analytically rather then numerically, in which
case large state spaces do not cause any problem (e.g. (6)-(7)).