| Display title | Computational complexity of matrix multiplication |
| Default sort key | Computational complexity of matrix multiplication |
| Page length (in bytes) | 35,353 |
| Namespace ID | 0 |
| Page ID | 251686 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Steve Marsio |
| Date of page creation | 23:32, 6 February 2024 |
| Latest editor | imported>Steve Marsio |
| Date of latest edit | 23:32, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In theoretical computer science, the computational complexity of matrix multiplication dictates how quickly the operation of matrix multiplication can be performed. Matrix multiplication algorithms are a central subroutine in theoretical and numerical algorithms for numerical linear algebra and optimization... |
