1 1 vote Which of the following is the recurrence relation for the matrix chain multiplication problem where p[i-1]*p[i] gives the dimension of the i^th matrix? dp[i,j]=1 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]} dp[i,j]=1 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]}+p[i-1]*p[k]*p[j] dp[i,j]=0 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]} dp[i,j]=0 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]}+p[i-1]*p[k]*p[j] Algorithms dynamic-programming algorithms matrix-chain-ordering + – Parshu gate 5.3k views answer comment Share Follow Print See 1 comment 1 1 comment reply bharti commented Nov 27, 2017 reply Follow flag 4th option is the correct one. 0 0 replyShare Please log in or register to add a comment.
1 1 vote .... Hira Thakur answered Nov 28, 2017 Hira Thakur comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Option 4 is the correct one. For detail explanation http://pegasus.uprm.edu/xryong/COMP6785/L12/L12.pdf AkashChandraGupta answered Aug 18, 2019 AkashChandraGupta comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Check below image................................ Himanshu Kumar Gupta answered Sep 8, 2020 Himanshu Kumar Gupta comment Share Follow 0 reply Please log in or register to add a comment.