MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the time complexity of the fastest known matrix multiplication algorithm? |
| A. | O(n<sup>log7</sup>) |
| B. | O(n<sup>2.37</sup>) |
| C. | O(n<sup>3</sup>) |
| D. | O(n!) |
| Answer» C. O(n<sup>3</sup>) | |