Hi, I read in this article that Matrix chain multiplication problem can be solved with O(N log N) by transforming it into the problem of partitioning a convex polygon into non-intersecting triangles.

but how can this done? do you know the details of O(N log N) solution?

thanks.