Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:describes |
asymptotic complexity of matrix multiplication
|
| gptkbp:field |
gptkb:mathematics
linear algebra matrix multiplication |
| https://www.w3.org/2000/01/rdf-schema#label |
Strassen's theorem
|
| gptkbp:improves |
gptkb:Coppersmith–Winograd_algorithm
|
| gptkbp:namedAfter |
gptkb:Volker_Strassen
|
| gptkbp:relatedTo |
gptkb:Strassen_algorithm
|
| gptkbp:significance |
first to show matrix multiplication can be done faster than cubic time
|
| gptkbp:state |
matrix multiplication can be performed in O(n^2.81) time
|
| gptkbp:yearProposed |
1969
|
| gptkbp:bfsParent |
gptkb:Volker_Strassen
|
| gptkbp:bfsLayer |
5
|