二維陣列: 矩陣鏈乘積最佳化問題(Optimal Array Multiplication Sequence)

1. 矩陣鏈乘積最佳化問題Matrix Chain Multiplication
2. Observation 1: different parenthesized leads to different complexity
3. Observation 2.1: How to parenthesize?
4. Observation 2.2: How to parenthesize?
5. Observation 2.3: How to parenthesize?
6. Observation 2.4: How to parenthesize?
7. Observation 2.4: How many combinations?
8. Complexity: 1*(n-1)+2*(n-2)+…+(n-1)*1=O(n3)
9. Design Issue 1: use one dimensional array to record size of matrixes
10. Design Issue 2: all possible combinations represent on a two dimensional array
11. 矩陣鏈乘積最佳化問題Matrix Chain Multiplication

1/11

Volume