On the algorithmic complexity of associative algebras
From MaRDI portal
Cites work
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Algebras Having Linear Multiplicative Complexities
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 3305793 (Why is no real title available?)
- scientific article; zbMATH DE number 3090508 (Why is no real title available?)
- New Fast Algorithms for Matrix Operations
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- On multiplication of 2 2 matrices
- On the optimal evaluation of a set of bilinear forms
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- Partial and Total Matrix Multiplication
- Some bilinear forms whose multiplicative complexity depends on the field of constants
Cited in
(31)- Semisimple algebras of almost minimal rank over the reals
- Rank and optimal computation of generic tensors
- Lower bounds in algebraic computational complexity
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- On a class of primary algebras of minimal rank
- Improved lower bounds for some matrix multiplication problems
- A lower bound for the multiplication of polynomials modulo a polynomial
- Multiplicative complexity of direct sums of quadratic systems
- On the complexity of the multiplication of matrices of small formats
- The complexity of bivariate power series arithmetic.
- Complexity of multiplication in commutative group algebras over fields of characteristic 0
- Beyond the Alder-Strassen bound.
- Structure of algebras of commutative matrices
- Lower bounds for algebraic algorithms for nilpotent and solvable Lie algebras
- Complexity of multiplication in commutative group algebras over fields of prime characteristic
- Group-theoretic lower bounds for the complexity of matrix multiplication
- Geometry and the complexity of matrix multiplication
- On computational complexity of Clifford algebra
- Algebraic and computational properties of a set of (0,1) matrices with prescribed sum
- Closure, commutativity and minimal complexity of some spaces of matrices
- Universal points in the asymptotic spectrum of tensors
- Lower bounds for algebraic complexity of nilpotent associative algebras.
- Algebraic complexities and algebraic curves over finite fields
- Commutative algebras of minimal rank
- Constructions of perfect bases for classes of 3-tensors
- Classifying entanglement by algebraic geometry
- Strassen's rank additivity for small tensors, including tensors of rank less or equal 7
- Some computational problems in linear algebra as hard as matrix multiplication
- Asymptotic spectra: theory, applications, and extensions
- On the direct sum conjecture
- Some path properties of generalized Lévy sheet
This page was built for publication: On the algorithmic complexity of associative algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154260)
