Implement both a standard Θ(n3) matrix multiplication algorithm and Strassen’s matrix multiplication algorithm (see Exercise 14.16.4.3). Using empirical testing, try to estimate the constant factors for the runtime equations of the two algorithms. How big must n be before Strassen’s algorithm becomes more efficient than the standard algorithm?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here