2 votes 2 votes Find an optimal parenthesization of a matrix-chain product whose sequence of di-mensions <5,10,3,12,5,50,6>. Algorithms algorithms dynamic-programming + – saurabh rai asked Mar 21, 2017 saurabh rai 4.1k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply utk0203 commented Mar 21, 2017 reply Follow Share 2310? 0 votes 0 votes saurabh rai commented Mar 22, 2017 reply Follow Share can u show ur work here ? 0 votes 0 votes utk0203 commented Mar 22, 2017 reply Follow Share I did it by matrix form .Here it is too lengthy . 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes 2010 Er Udit Mishra answered Aug 9, 2017 Er Udit Mishra comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes http://www.inf.ed.ac.uk/teaching/courses/ads/Lects/sols6.pdf akash.dinkar12 answered Mar 21, 2017 akash.dinkar12 comment Share Follow See 1 comment See all 1 1 comment reply Er Udit Mishra commented Aug 9, 2017 reply Follow Share @akash.dinkar12 sir, you missed one of the dimensions i.e. 3 in your solution. 0 votes 0 votes Please log in or register to add a comment.