Regarding matrix chain multiplication

#1

could we somehow boil down the complexity to o(n^2)
because i feel like its possible…but finding it difficult to implement it…any insights would be appreciated

#2

If you are talking about the time complexity then the most efficient one until now is O(n^3).