Direct sums of bilinear algorithms (Q1157377): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the number of multiplications necessary to compute certain functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some bilinear forms whose multiplicative complexity depends on the field of constants / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the multiplicative complexity of the discrete Fourier transform / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Computational Complexity of Continued Fractions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the optimal evaluation of a set of bilinear forms / rank | |||
Normal rank | |||
Latest revision as of 13:57, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Direct sums of bilinear algorithms |
scientific article |
Statements
Direct sums of bilinear algorithms (English)
0 references
1981
0 references
bilinear algorithm
0 references
minimal algorithm
0 references
direct sum
0 references
