There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
The purpose of this project is to practically investigate the efficiency of Strassen’s algorithm to multiply two square “long integer” random matrices of size 2𝑛×2𝑛. The input values are random integers in the range [-100,100].
