Show that none of the following greedy algorithms for chained matrix multiplication work. At each step
a. Compute the cheapest multiplication.
b. Compute the most expensive multiplication.
c. Compute the multiplication between the two matrices Mi and Mi+1, such that the number of columns in Mi is minimized (breaking ties by one of the rules above).
We need at least 9 more requests to produce the solution.
1 / 10 have requested this problem solution
The more requests, the faster the answer.