Improved method for finding optimal formulas for bilinear maps in a finite field
From MaRDI portal
Publication:2272384
DOI10.1016/j.tcs.2019.04.029zbMath1430.68456arXiv1705.07728OpenAlexW2775048036WikidataQ127832043 ScholiaQ127832043MaRDI QIDQ2272384
Publication date: 10 September 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.07728
bilinear mapmatrix multiplicationpolynomial multiplicationfinite field arithmeticoptimal formulasbilinear rank
Symbolic computation and algebraic computation (68W30) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Approximation algorithms (68W25)
Related Items
The quadratic hull of a code and the geometric view on multiplication algorithms ⋮ Trisymmetric multiplication formulae in finite fields
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Even faster integer multiplication
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Optimization techniques for small matrix multiplication
- Matrix multiplication via arithmetic progressions
- Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
- Lectures on the complexity of bilinear problems
- On fast multiplication of polynomials over arbitrary algebras
- Fast multiplication of polynomials over fields of characteristic 2
- On the optimal evaluation of a set of bilinear forms
- The Magma algebra system. I: The user language
- On the complexity of the multiplication of matrices of small formats
- Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25
- General tensor decomposition, moment matrices and applications
- Gaussian elimination is not optimal
- Fast multiplication of large numbers
- The bilinear complexity and practical algorithms for matrix multiplication
- Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms
- Finding Optimal Formulae for Bilinear Maps
- Faster Polynomial Multiplication over Finite Fields
- Tensor rank is NP-complete
- Five, six, and seven-term Karatsuba-like formulae
- Powers of tensors and fast matrix multiplication
- Optimal Evaluation of Pairs of Bilinear Forms
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- On the Additive Complexity of Matrix Multiplication
- Implementing Fast Carryless Multiplication
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Algebraic complexities and algebraic curves over finite fields
