Very Fast Approximation of the Matrix Chain Product Problem

Artur Czumaj
1996 Journal of Algorithms  
This paper considers the matrix chain product problem. This problem can be Ž . solved in O n log n sequential time, while the best known parallel NC algorithm Ž 2 .
doi:10.1006/jagm.1996.0037 fatcat:nbo2umellratzfzwr2gssyzpce