节点文献
最佳矩阵链乘的近似算法
The Approximate Algorithm of Optimum Matrix Link Multiplication
【摘要】 讨论了与矩阵链乘最佳顺序有关的问题.提出了求解矩阵链乘的有效近似算法.分析和总结了矩阵链乘有关时间复杂度和空间复杂度等重要性质.
【Abstract】 Problems of the optimum sequence of matrix link multiplication are disscussed.Moreover,the effective approximate algorithm of matrix link multiplication solved is raised.Besides,some main characters of matrix link multiplication about asymptotic time complexity,space complexity and so on are analysed in detail.
【关键词】 算法;
复杂度;
最佳顺序;
矩阵链乘;
【Key words】 Algorithm Complexity Optimum sequence Matrix link multiplication;
【Key words】 Algorithm Complexity Optimum sequence Matrix link multiplication;
- 【文献出处】 长沙电力学院学报(自然科学版) ,JOURNAL OF CHANGSHA UNIVERSITY OF ELECTRIC POWER(NATURAL SCIENCE) , 编辑部邮箱 ,1999年03期
- 【分类号】O241.6
- 【被引频次】1
- 【下载频次】48