Multiplicative complexity of direct sums of quadratic systems (Q1347225)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multiplicative complexity of direct sums of quadratic systems |
scientific article; zbMATH DE number 740261
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiplicative complexity of direct sums of quadratic systems |
scientific article; zbMATH DE number 740261 |
Statements
Multiplicative complexity of direct sums of quadratic systems (English)
0 references
4 April 1995
0 references
The author considers certain sets of quadratic forms and studies classes of direct sums of quadratic forms. For these classes of problems he shows that the complexity of one direct sum is the sum of the complexities of the summands and that every minimal quadratic algorithm for computing the direct sums is a direct-sum algorithm.
0 references
quadratic systems
0 references
bilinear form
0 references
minimal rank
0 references
quadratic forms
0 references
direct sums
0 references
complexity
0 references
minimal quadratic algorithm
0 references
direct-sum algorithm
0 references
0 references
0 references
