Algorithmcore
Divide-and-conquer matrix multiplication
Also called Simple divide-and-conquer matrix multiplication.
A recursive method that multiplies two n by n matrices by splitting each into four submatrices and combining eight smaller products.
A recursive method that multiplies two n by n matrices by splitting each into four submatrices and combining eight smaller products.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 4CTYKM Edit this page History Report an error