On the direct sum conjecture in the straight line model
From MaRDI portal
Publication:1265137
DOI10.1006/jcom.1997.0466zbMath0919.68014OpenAlexW2015293982WikidataQ122926399 ScholiaQ122926399MaRDI QIDQ1265137
Publication date: 1998
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b4fbd30df8b4e47bda860a17686139bd09869924
Related Items (4)
Abelian tensors ⋮ The choice and agreement problems of a random function ⋮ The direct sum of universal relations ⋮ The communication complexity of enumeration, elimination, and selection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to multiply matrices faster
- On the direct sum conjecture
- 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 multiplication in algebraic extension fields
- Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
- Certain systems of bilinear forms whose minimal algorithms are all quadratic
- On the Validity of the Direct Sum Conjecture
- On systems of bilinear forms whose minimal division-free algorithms are all bilinear
- Some bilinear forms whose multiplicative complexity depends on the field of constants
- Algebras Having Linear Multiplicative Complexities
This page was built for publication: On the direct sum conjecture in the straight line model
