文件名称:juzhenliancheng
介绍说明－－下载内容均来自于网络，请自行研究使用
给定n个矩阵A1，A2，…，An，其中，Ai与Aj+1是可乘的，i=1，2，…，n-l。
你的任务是要确定矩阵连乘的运算次序，使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。
-Given n matrices A1, A2, ..., An, which, Ai and Aj+1 is multiplicative in, i = 1,2, ..., nl. Your task is to determine the matrix multiplication operation with the order to calculate the product of n matrices even when A1A2 ... An element of the total number of multiplications to a minimum.
你的任务是要确定矩阵连乘的运算次序，使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。
-Given n matrices A1, A2, ..., An, which, Ai and Aj+1 is multiplicative in, i = 1,2, ..., nl. Your task is to determine the matrix multiplication operation with the order to calculate the product of n matrices even when A1A2 ... An element of the total number of multiplications to a minimum.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
矩阵连乘问题\111.cpp
............\111.msp
............\Debug\111.exe
............\.....\111.o
............\Debug
矩阵连乘问题
............\111.msp
............\Debug\111.exe
............\.....\111.o
............\Debug
矩阵连乘问题