On the algorithmic complexity of associative algebras
From MaRDI portal
Publication:1154260
DOI10.1016/0304-3975(81)90070-0zbMath0464.68045OpenAlexW2088804960MaRDI QIDQ1154260
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(81)90070-0
Analysis of algorithms and problem complexity (68Q25) Finite rings and finite-dimensional associative algebras (16P10) Multilinear algebra, tensor calculus (15A69)
Related Items
Universal points in the asymptotic spectrum of tensors, Multiplicative complexity of direct sums of quadratic systems, Structure of algebras of commutative matrices, Commutative algebras of minimal rank, Some path properties of generalized Lévy sheet, Geometry and the complexity of matrix multiplication, On the complexity of the multiplication of matrices of small formats, The complexity of bivariate power series arithmetic., Constructions of perfect bases for classes of 3-tensors, 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, On computational complexity of Clifford algebra, A lower bound for the multiplication of polynomials modulo a polynomial, Some computational problems in linear algebra as hard as matrix multiplication, Complexity of multiplication in commutative group algebras over fields of characteristic 0, Algebraic complexities and algebraic curves over finite fields, Lower bounds for algebraic complexity of nilpotent associative algebras., Beyond the Alder-Strassen bound., Semisimple algebras of almost minimal rank over the reals, Closure, commutativity and minimal complexity of some spaces of matrices, Rank and optimal computation of generic tensors, Lower bounds in algebraic computational complexity, Combinatorial analysis (nonnegative matrices, algorithmic problems), Algebraic and computational properties of a set of (0,1) matrices with prescribed sum, On the direct sum conjecture, On a class of primary algebras of minimal rank, Improved lower bounds for some matrix multiplication problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- On the optimal evaluation of a set of bilinear forms
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- New Fast Algorithms for Matrix Operations
- Partial and Total Matrix Multiplication
- Some bilinear forms whose multiplicative complexity depends on the field of constants
- Algebras Having Linear Multiplicative Complexities
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
