文件名称:Matrix-Chain_JAVA
介绍说明--下载内容均来自于网络,请自行研究使用
Matrix Chain Multiplication is perhaps the quintessential example of dynamic programming. The problem can be stated as follows: given a chain <A1, A2,..., An> of n matrices, where for i = 1, 2,...,n, matrix Ai has dimension pi-1 x pi, fully parenthesize the product A1A2...An in a way that minimizes the number of scalar multiplications.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Main.java