International audienceWe establish new upper bounds about symmetric bilinear complexity in any extension of finite fields. Note that these bounds are not asymptotical but uniform. Moreover, we discuss the validity of certain published bounds
International audienceWe obtain new uniform bounds for the symmetric tensor rank of multiplication i...
AbstractA lower bound on rank is constructed for arbitrary tensors over finite fields. For fields of...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
International audienceWe establish new upper bounds about symmetric bilinear complexity in any exten...
AbstractWe generalize the multiplication algorithm of D.V. and G.V. Chudnovsky. Using the new algori...
In this paper, we give a survey of the known results concerning the tensor rank of the multiplicatio...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
International audienceWe obtain new asymptotical bounds for the symmetric tensor rank of multiplicat...
International audienceIn this paper, we give a survey of the known results concerning the tensor ran...
AbstractIn this paper, we obtain new bounds for the tensor rank of multiplication in any extension o...
International audienceIn this paper, we obtain new bounds for the tensor rank of multiplication in a...
In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric ten...
International audienceWe obtain new uniform bounds for the symmetric tensor rank of multiplication i...
AbstractA lower bound on rank is constructed for arbitrary tensors over finite fields. For fields of...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
International audienceWe establish new upper bounds about symmetric bilinear complexity in any exten...
AbstractWe generalize the multiplication algorithm of D.V. and G.V. Chudnovsky. Using the new algori...
In this paper, we give a survey of the known results concerning the tensor rank of the multiplicatio...
International audienceWe obtain new uniform upper bounds for the tensor rank of the multiplication i...
International audienceWe obtain new asymptotical bounds for the symmetric tensor rank of multiplicat...
International audienceIn this paper, we give a survey of the known results concerning the tensor ran...
AbstractIn this paper, we obtain new bounds for the tensor rank of multiplication in any extension o...
International audienceIn this paper, we obtain new bounds for the tensor rank of multiplication in a...
In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric ten...
International audienceWe obtain new uniform bounds for the symmetric tensor rank of multiplication i...
AbstractA lower bound on rank is constructed for arbitrary tensors over finite fields. For fields of...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
DOI
Add to ORKG