Number Theory on Data Structure and Algorithms related Questions and Answers


Question :   What is the running time of Strassen's algorithm for matrix multiplication?
1. O(n2.81)
2. O(n3)
3. O(n1.8)
4. O(n2)
Answer :   1 - O(n2.81)  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter