Trisymmetric multiplication formulae in finite fields
From MaRDI portal
Publication:2232213
DOI10.1007/978-3-030-68869-1_5zbMath1480.12001OpenAlexW3129362925MaRDI QIDQ2232213
Hugues Randriambololona, Édouard Rousseau
Publication date: 4 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-68869-1_5
Symbolic computation and algebraic computation (68W30) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Field arithmetic (12E30) Computational methods for problems pertaining to field theory (12-08)
Related Items (1)
Cites Work
- Unnamed Item
- \((2,1)\)-separating systems beyond the probabilistic bound
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Multiplication algorithm in a finite field and tensor rank of the multiplication.
- Gaps between prime numbers and tensor rank of multiplication in finite fields
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
- Improved method for finding optimal formulas for bilinear maps in a finite field
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- On products and powers of linear codes under componentwise multiplication
- Finding Optimal Formulae for Bilinear Maps
- Algebraic Function Fields and Codes
- On symmetric algorithms for bilinear forms over finite fields
- Some bilinear forms whose multiplicative complexity depends on the field of constants
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
- Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields
- Algebraic complexities and algebraic curves over finite fields
This page was built for publication: Trisymmetric multiplication formulae in finite fields
