Algebras Having Linear Multiplicative Complexities
From MaRDI portal
Cited in
(29)- Multiplicative complexity and algebraic structure
- Lower bounds in algebraic computational complexity
- 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\)
- The complexity of basic complex operations
- On the algorithmic complexity of associative algebras
- New combinations of methods for the acceleration of matrix multiplication
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
- Fast matrix multiplication without APA-algorithms
- On the complexity of multiplication in finite fields
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Some elementary proofs of lower bounds in complexity theory
- Global properties of tensor rank
- On multiplication in algebraic extension fields
- On the multiplicative complexity of the discrete Fourier transform
- Lower bounds of the complexity of linear algebras
- On the direct sum conjecture in the straight line model
- Multiplicative complexity of direct sums of quadratic systems
- Structure of algebras of commutative matrices
- Algebraic and computational properties of a set of (0,1) matrices with prescribed sum
- Some bilinear forms whose multiplicative complexity depends on the field of constants
- On Computing the Discrete Fourier Transform
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Closure, commutativity and minimal complexity of some spaces of matrices
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
- The quadratic hull of a code and the geometric view on multiplication algorithms
- Algebraic complexities and algebraic curves over finite fields
- AWE: Adaptive Weight Encoding for Exact Integer Matrix Products with Fewer GEMMs on FP4 Tensor Cores
- On the maximal multiplicative complexity of a family of bilinear forms
- On the direct sum conjecture
This page was built for publication: Algebras Having Linear Multiplicative Complexities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4160410)