Lectures on the complexity of bilinear problems
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)
- scientific article; zbMATH DE number 48553 (Why is no real title available?)
- Multilinear algebra and parallel programming
- scientific article; zbMATH DE number 7753345 (Why is no real title available?)
- The complexity of bivariate power series arithmetic.
- On the direct sum conjecture in the straight line model
- Semisimple algebras of almost minimal rank over the reals
- scientific article; zbMATH DE number 4112009 (Why is no real title available?)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Multiplicative complexity of direct sums of quadratic systems
- scientific article; zbMATH DE number 4057703 (Why is no real title available?)
- Beyond the Alder-Strassen bound.
- On a class of primary algebras of minimal rank
- Complexity and geometry of bilinear maps
- On the order of approximation in approximative triadic decompositions of tensors
- Improved method for finding optimal formulas for bilinear maps in a finite field
- scientific article; zbMATH DE number 4124896 (Why is no real title available?)
- A Complete Characterization of the Algebras of Minimal Bilinear Complexity
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks
- Maximal bilinear complexity and codes
- Bilinear mincing rank
- Communication complexity of multi-processor systems
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
- Optimal evaluation of pairs of bilinear forms
- A lower bound for the border rank of a bilinear map
- On the complexity of the multiplication of matrices of small formats
- On the rank of certain finite fields
- scientific article; zbMATH DE number 922253 (Why is no real title available?)
- An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
- The border rank of the multiplication of $2\times 2$ matrices is seven
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)
