Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:category |
divide and conquer algorithms
matrix algorithms |
| gptkbp:complexity |
O(n^2.8074)
|
| gptkbp:field |
computer science
linear algebra matrix multiplication |
| gptkbp:generalizes |
gptkb:Coppersmith–Winograd_algorithm
|
| https://www.w3.org/2000/01/rdf-schema#label |
Strassen algorithm
|
| gptkbp:improves |
naive matrix multiplication
|
| gptkbp:influenced |
fast matrix multiplication research
|
| gptkbp:input |
two matrices
|
| gptkbp:introducedIn |
1969
|
| gptkbp:inventedBy |
gptkb:Volker_Strassen
|
| gptkbp:limitation |
numerical stability
not always faster for small matrices |
| gptkbp:namedAfter |
gptkb:Volker_Strassen
|
| gptkbp:output |
product matrix
|
| gptkbp:purpose |
matrix multiplication
|
| gptkbp:reducesMultiplications |
from 8 to 7 for 2x2 matrices
|
| gptkbp:uses |
divide and conquer
|
| gptkbp:bfsParent |
gptkb:Volker_Strassen
|
| gptkbp:bfsLayer |
5
|