pankajkumar Posted May 30, 2013 Posted May 30, 2013 find the optimal sequence and minimum number of operations required for the following chain matrix multiplication using dynamic programming. A(30,40) B(40,5) C(5,15) D(15,6)
EdEarl Posted May 30, 2013 Posted May 30, 2013 Is this homework? You should tell what progress you have made. People here prefer to help with homework, not give final answers.
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now