Finding optimal Chudnovsky-Chudnovsky multiplication algorithms
From MaRDI portal
Recommendations
- An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
Cites work
- scientific article; zbMATH DE number 1488177 (Why is no real title available?)
- Algebraic complexities and algebraic curves over finite fields
- Algebraic function fields and codes
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Defining equations of modular curves
- Finding optimal formulae for bilinear maps
- Five, six, and seven-term Karatsuba-like formulae
- General tensor decomposition, moment matrices and applications
- Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
- Multiplication of polynomials modulo \(x^n\)
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
- Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
- The M4RIE library for dense linear algebra over small fields with even characteristic
- The Magma algebra system. I: The user language
Cited in
(7)- Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
- Improved method for finding optimal formulas for bilinear maps in a finite field
- On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields
- scientific article; zbMATH DE number 5896947 (Why is no real title available?)
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
- An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
This page was built for publication: Finding optimal Chudnovsky-Chudnovsky multiplication algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949471)