Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upStrassen's Algorithm Implementation #1714
Open
Conversation
The program accepts two n*n matrices, then implements Strassen's Algorithm to calculate the product of those two matrices in O(n^2.80) time complexity.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
The program accepts two n*n matrices, then implements Strassen Algorithm to calculate the product of those two matrices in O(n^2.80) time complexity instead of O(n^3).
Describe your change:
Added a program to implement Strassen Algorithm for matrix multiplication in O(2^2.80) time complexity.
Wikipedia reference to Strassen Algorithm: https://en.wikipedia.org/wiki/Strassen_algorithm
References
Checklist: