Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication (Q3759936): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0215043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992111571 / rank | |||
Normal rank | |||
Latest revision as of 22:49, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication |
scientific article |
Statements
Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication (English)
0 references
1986
0 references
computational complexity
0 references
infinite family of noncommutative bilinear algorithms
0 references
3\(\times 3\) matrix multiplication
0 references
Strassen's algorithm
0 references
