A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line
From MaRDI portal
(Redirected from Publication:5880200)
Recommendations
- 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
- Chudnovsky-type algorithms over the projective line using generalized evaluation maps
- On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields
- On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation
Cites work
- Algebraic complexities and algebraic curves over finite fields
- Algebraic Function Fields and Codes
- An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
- Fast multiplication of large numbers
- Fast polynomial multiplication over \(\mathbb{F}_{2^{60}}\)
- Faster integer multiplication
- scientific article; zbMATH DE number 125907 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- Integer and polynomial multiplication: towards optimal Toom-Cook matrices
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
- On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields
- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
- Polynomial multiplication over finite fields in time O(n n)
- Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15
- The Magma algebra system. I: The user language
- Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
Cited in
(6)- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
- On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields
- Degree-𝑑 chow parameters robustly determine degree-𝑑 PTFs (and algorithmic applications)
- Chudnovsky-type algorithms over the projective line using generalized evaluation maps
- Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity
- Iterative constructions of irreducible polynomials from isogenies
This page was built for publication: A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5880200)
