On systems of bilinear forms whose minimal division-free algorithms are all bilinear (Q3932296): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users 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.1016/0196-6774(81)90026-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021964609 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On systems of bilinear forms whose minimal division-free algorithms are all bilinear |
scientific article |
Statements
On systems of bilinear forms whose minimal division-free algorithms are all bilinear (English)
0 references
1981
0 references
bilinear algorithms
0 references
computing products in finite algebraic extension fields
0 references
computing the products of Toeplitz and Hankel matrices with vectors
0 references
multiplicative complexity of the quaternion product
0 references
