Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Strassen’s Matrix Multiplication #306

Open
manan2110 opened this issue Oct 14, 2020 · 1 comment
Open

Strassen’s Matrix Multiplication #306

manan2110 opened this issue Oct 14, 2020 · 1 comment

Comments

@manan2110
Copy link

Title or Name of the Algorithm:-
Strassen’s Matrix Multiplication

Describe the algorithm:-
In the divide and conquer method of multipying matrices , the main component for high time complexity is 8 recursive calls. The idea of Strassen’s method is to reduce the number of recursive calls to 7.

@Abhishek-7017
Copy link

Please assign me this problem i can solve it

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants