On systems of bilinear forms whose minimal division-free algorithms are all bilinear (Q3932296)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3748413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On systems of bilinear forms whose minimal division-free algorithms are all bilinear |
scientific article; zbMATH DE number 3748413 |
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
