|
|
|
|
|
|
by Murky3515
698 days ago
|
|
|
You're wrong, and I don't know why you're being stubborn about this. HDP is a different class of algorithms that uses DP, but it is not DP. A basic read of wikipedia of dynamic programming reveals the key pieces of DP: There are two key attributes that a problem must have in order for dynamic programming to be applicable: optimal substructure and overlapping sub-problems. ... Optimal substructure means that the solution to a given optimization problem can be obtained by the combination of optimal solutions to its sub-problems. See the words optimal and optimization? https://en.wikipedia.org/wiki/Dynamic_programming |
|
|