CAJ | 학술논문

通过分析矩阵序列乘法的特点，找到了一种新的算法-最小维数边界吸收算法，并将此算法分别与穷举搜索算法、动态规划算法的时间复杂度及空间复杂度进行分析比较。可以看出，动态规划算法的时间复杂度为O（n3），空间复杂度为O（n2），而本算法的时间复杂度和空间复杂度均为O（n），并且不需要额外的空间开销。
통과분석구진서렬승법적특점，조도료일충신적산법-최소유수변계흡수산법，병장차산법분별여궁거수색산법、동태규화산법적시간복잡도급공간복잡도진행분석비교。가이간출，동태규화산법적시간복잡도위O（n3），공간복잡도위O（n2），이본산법적시간복잡도화공간복잡도균위O（n），병차불수요액외적공간개소。
According to the characteristics of matrix multiply in succession ,a new algorithm-the least dimension boundary absorb algorithm was found .In addition ,the space and time complexity of the ex-haustive search algorithm and the dynamic programming algorithm were compared with the new algo-rithm .The results show that the time complexity of the dynamic programming algorithm is O(n3 ) and the space complexity is O(n2 ) ,w hile the space and time complexity of the new algorithrn are both O(n) , what′s more ,the algorithm does not need the extra storage space .