Lectures on the complexity of bilinear problems
zbMATH Open0609.68032MaRDI QIDQ1087014FDOQ1087014
Authors: Hans F. de Groote 
Publication date: 1987
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Recommendations
tensorsbilinear algorithmsmatrix multiplicationvarietytensor rankalgebraic complexitybilinear mappingsborder rankmultiplication of polynomialsalgebras of minimal rankmultiplication in algebrasmultiplication tensor
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Vector and tensor algebra, theory of invariants (15A72) Endomorphism rings; matrix rings (16S50) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02) Research exposition (monographs, survey articles) pertaining to associative rings and algebras (16-02)
Cited In (29)
- A lower bound for the border rank of a bilinear map
- An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
- On the order of approximation in approximative triadic decompositions of tensors
- The complexity of bivariate power series arithmetic.
- A Complete Characterization of the Algebras of Minimal Bilinear Complexity
- On the direct sum conjecture in the straight line model
- Bilinear mincing rank
- Communication complexity of multi-processor systems
- Title not available (Why is that?)
- Improved method for finding optimal formulas for bilinear maps in a finite field
- Title not available (Why is that?)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- On the rank of certain finite fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- The border rank of the multiplication of $2\times 2$ matrices is seven
- Title not available (Why is that?)
- Multilinear algebra and parallel programming
- Semisimple algebras of almost minimal rank over the reals
- On a class of primary algebras of minimal rank
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
- Multiplicative complexity of direct sums of quadratic systems
- Beyond the Alder-Strassen bound.
- Complexity and geometry of bilinear maps
- Title not available (Why is that?)
- Optimal evaluation of pairs of bilinear forms
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks
- On the complexity of the multiplication of matrices of small formats
- Maximal bilinear complexity and codes
This page was built for publication: Lectures on the complexity of bilinear problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087014)
