AbstractFrom the existence of algebraic function fields having some good properties, we obtain some new upper bounds on the bilinear complexity of multiplication in all extensions of the finite field Fq, where q is an arbitrary prime power. So we prove that the bilinear complexity of multiplication in the finite fields Fqn is linear uniformly in q with respect to the degree n
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
AbstractGeneralizing the norm and trace mappings for Fqr/Fq, we introduce an interesting class of po...
AbstractWe generalize the multiplication algorithm of D.V. and G.V. Chudnovsky. Using the new algori...
AbstractFrom the existence of algebraic function fields having some good properties, we obtain some ...
AbstractFrom the existence of a tower of algebraic function fields with more steps than the Garcia–S...
AbstractFrom an interpolation method on algebraic curves, due to D.V. Chudnovsky and G.V. Chudnovsky...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
AbstractWe present a method for multiplication in finite fields which gives multiplication algorithm...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provid...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
AbstractGeneralizing the norm and trace mappings for Fqr/Fq, we introduce an interesting class of po...
AbstractWe generalize the multiplication algorithm of D.V. and G.V. Chudnovsky. Using the new algori...
AbstractFrom the existence of algebraic function fields having some good properties, we obtain some ...
AbstractFrom the existence of a tower of algebraic function fields with more steps than the Garcia–S...
AbstractFrom an interpolation method on algebraic curves, due to D.V. Chudnovsky and G.V. Chudnovsky...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
AbstractWe present a method for multiplication in finite fields which gives multiplication algorithm...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provid...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
AbstractGeneralizing the norm and trace mappings for Fqr/Fq, we introduce an interesting class of po...