Multiplicative complexity of direct sums of quadratic systems
From MaRDI portal
Publication:1347225
DOI10.1016/0024-3795(93)00088-HzbMath0820.15015MaRDI QIDQ1347225
Publication date: 4 April 1995
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
complexitydirect sumsquadratic formsbilinear formquadratic systemsminimal rankdirect-sum algorithmminimal quadratic algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Commutative algebras of minimal rank
- On the maximal multiplicative complexity of a family of bilinear forms
- On the direct sum conjecture
- On a class of primary algebras of minimal rank
- Lectures on the complexity of bilinear problems
- Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u/<Q(u)^{\ell}>\), \(\ell >1\)]
- On varieties of optimal algorithms for the computation of bilinear mappings. III. Optimal algorithms for the computation of \(xy\) and \(yx\) where \(x,y\in M_2(K)\)
- On the algorithmic complexity of associative algebras
- Direct sums of bilinear algorithms
- On the complexity of multiplication in finite fields
- On the complexity of quaternion multiplication
- The complexity of vector-products
- On the optimal evaluation of a set of bilinear forms
- On multiplication in algebraic extension fields
- On multiplication of 2 \(\times\) 2 matrices
- Maximal bilinear complexity and codes
- A structure theory for Jordan algebras
- The Ranks of $m \times n \times (mn - 2)$ Tensors
- Maximal Rank of $m\times n\times(mn-k)$ Tensors
- Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
- On the Validity of the Direct Sum Conjecture
- Multiplicative complexity of polynomial multiplication over finite fields
- On the Complexity of Bilinear Forms with Commutativity
- Partial and Total Matrix Multiplication
- On systems of bilinear forms whose minimal division-free algorithms are all bilinear
- A classification of algorithms for multiplying polynomials of small degree over finite fields
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- Some bilinear forms whose multiplicative complexity depends on the field of constants
- Algebras Having Linear Multiplicative Complexities
- A Lower Bound for Matrix Multiplication
- On the Complexity of Bilinear Forms over Associative Algebras
- On the number of multiplications necessary to compute certain functions
This page was built for publication: Multiplicative complexity of direct sums of quadratic systems