Question

The time complexity of the Strassen’s algorithm for matrix multiplication is:

A O(n².⁸⁰⁷)
B O(n³)
C O(n log n)
D O(n²)
Practice Next

Relevant for Exams:

Hey! Ask a query