On multiplication in algebraic extension fields

Cites work

Algebras Having Linear Multiplicative Complexities
On computing the Discrete Fourier Transform
Some bilinear forms whose multiplicative complexity depends on the field of constants

Cited in

(24)

Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
On the direct sum conjecture in the straight line model
On the complexity of multiplication in finite fields
Multiplicative complexity of direct sums of quadratic systems
New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields
Tower of algebraic function fields with maximal Hasse-Witt invariant and tensor rank of multiplication in any extension of \(\mathbb{F}_2\) and \(\mathbb{F}_3\)
Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15
On the tensor rank of multiplication in any extension of \(\mathbb F_2\)
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u]/\langle{} u^ n \rangle\)
An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
On some bounds for symmetric tensor rank of multiplication in finite fields
On the bounds of the bilinear complexity of multiplication in some finite fields
On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
Circuits for computing the GCD of two polynomials over an algebraic number field
On the bilinear complexity of the multiplication in small finite fields
On the tensor rank of the multiplication in the finite fields
Chudnovsky-type algorithms over the projective line using generalized evaluation maps
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u]/<Q(u)^{\ell}>\), \(\ell >1\)
Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
Multiplication algorithm in a finite field and tensor rank of the multiplication.
On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
On the rank of certain finite fields
An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)

This page was built for publication: On multiplication in algebraic extension fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1256512)