Find optimal parenthesization of a matrix chain product using Dynamic Programming paradigm.

3Comments
Habib Mohammad Khan @habibkhan
26 Aug 2017 10:00 am

Here brute forcing method will not work efficiently as number of parenthesisations here will be : C(12,6) / (6+1) which is a fairly large number..we cannot check these much parenthesisations within limited time..

So dynamic programming recurrence is a must to use here..

set2018 @setgate
26 Aug 2017 11:21 am

pls explain the sequence.How can i implement this sequence using bottom up approach of dnamic programming

Habib Mohammad Khan @habibkhan
26 Aug 2017 04:21 pm

Just dry run through the matrix multiplication problem..; The one which also keeps track of paranthesisation..