Editing Matrix chain multiplication (section)

=== Other ''O''(''n''&nbsp;log&nbsp;''n'') algorithms ===

Wang, Zhu and Tian have published a simplified ''O''(''n''&nbsp;log&nbsp;''m'') algorithm, where ''n'' is the number of matrices in the chain and ''m'' is the number of local minimums in the dimension sequence of the given matrix chain.<ref>{{cite book |last1=Wang |first1=Xiaodong |last2=Zhu |first2=Daxin |last3=Tian |first3=Jun |title=2013 8th International Conference on Computer Science & Education |chapter=Efficient computation of matrix chain |date=April 2013 |pages=703–707 |doi=10.1109/ICCSE.2013.6553999|isbn=978-1-4673-4463-0 |s2cid=17303326 }}</ref>

Nimbark, Gohel, and Doshi have published a greedy ''O''(''n''&nbsp;log&nbsp;''n'') algorithm,<ref>{{cite book |last1=Nimbark |first1=Hitesh |last2=Gohel |first2=Shobhen |last3=Doshi |first3=Nishant |chapter=A Novel Approach for Matrix Chain Multiplication Using Greedy Technique for Packet Processing |title=Computer Networks and Information Technologies |series=Communications in Computer and Information Science |date=2011 |volume=142 |pages=318–321 |doi=10.1007/978-3-642-19542-6_58|isbn=978-3-642-19541-9 }}</ref> but their proof of optimality is incorrect and their algorithm fails to produce the most efficient parentheses assignment for some matrix chains.<ref name=Schwartz/>