Next:
Dynamic Programming
Matrix Multiplication
Matrix Multiplication Parenthesization
Brute Force Solution: Try all possible parenthesizations
Dynamic Programming Solution (4 steps)
Step 1: Characterize Structure of Optimal Solution
Step 2: Define recursive solution
Recursive Solution
Analysis
Duplicate Subproblems
Unique Subproblems
Step 3: Bottom-Up Approach
Dynamic Programming
Step 4: Construct Optimal Solution
Elements of Dynamic Programming
Memoization
Longest Common Subsequence (LCS)
Dynamic Programming
Dynamic Programming
Distinct Subproblems
Pseudocode
Optimal Polygon Triangulation
Optimal Polygon Triangulation
Optimal Polygon Triangulation
Applications
Next: