Efficient computation of matrix chain


We consider the matrix chain ordering problem to determine the optimal computation order of the matrix chain products. A new algorithm for the matrix chain ordering problem is presented. The time complexity of the presented algorithm is O(n log m), where n is the number of matrices in the chain and m is the number of local minimums in the dimension sequence… (More)


Cite this paper

@article{Wang2013EfficientCO, title={Efficient computation of matrix chain}, author={Xiaodong Robert Wang and Daxin Zhu and Jun Tian}, journal={2013 8th International Conference on Computer Science & Education}, year={2013}, pages={703-707} }