In 2012, Barbulescu, Detrey, Estibals and Zimmermann proposed a new framework to exhaustively search for optimal formulae for evaluating bilinear maps, such as Strassen or Karatsuba formulae. The main contribution of this work is a new criterion to aggressively prune useless branches in the exhaustive search, thus leading to the computation of new optimal formulae, in particular for the short product modulo X 5 and the circulant product modulo (X 5 − 1). Moreover , we are able to prove that there is essentially only one optimal decomposition of the product of 3 x 2 by 2 x 3 matrices up to the action of some group of automorphisms
AbstractFrom an interpolation method on algebraic curves, due to D.V. Chudnovsky and G.V. Chudnovsky...
AbstractWe wish to answer the following question: p matrices Bi, of the same dimension, being given,...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
International audienceWe describe a unified framework to search for optimal formulae evaluating bili...
AbstractWe propose two exhaustive search-type methods for the construction of Karatsuba-like algorit...
Since 1960 and the result of Karatsuba, we know that the complexity of the multiplication (of intege...
AbstractWe present a method for multiplication in finite fields which gives multiplication algorithm...
AbstractAlthough general theories are beginning to emerge in the area of automata based complexity t...
AbstractIn this paper we consider optimal algorithms for the computation of Φ:(x,y)↦ (xy,yx), where ...
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provid...
AbstractWe generalize the multiplication algorithm of D.V. and G.V. Chudnovsky. Using the new algori...
International audienceMultiplication is an expensive arithmetic operation, therefore there has been ...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
We present a method for multiplication in finite fields which gives multiplication algorithms with i...
Depuis 1960 et le résultat fondateur de Karatsuba, on sait que la complexité de la multiplication (d...
AbstractFrom an interpolation method on algebraic curves, due to D.V. Chudnovsky and G.V. Chudnovsky...
AbstractWe wish to answer the following question: p matrices Bi, of the same dimension, being given,...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
International audienceWe describe a unified framework to search for optimal formulae evaluating bili...
AbstractWe propose two exhaustive search-type methods for the construction of Karatsuba-like algorit...
Since 1960 and the result of Karatsuba, we know that the complexity of the multiplication (of intege...
AbstractWe present a method for multiplication in finite fields which gives multiplication algorithm...
AbstractAlthough general theories are beginning to emerge in the area of automata based complexity t...
AbstractIn this paper we consider optimal algorithms for the computation of Φ:(x,y)↦ (xy,yx), where ...
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provid...
AbstractWe generalize the multiplication algorithm of D.V. and G.V. Chudnovsky. Using the new algori...
International audienceMultiplication is an expensive arithmetic operation, therefore there has been ...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
We present a method for multiplication in finite fields which gives multiplication algorithms with i...
Depuis 1960 et le résultat fondateur de Karatsuba, on sait que la complexité de la multiplication (d...
AbstractFrom an interpolation method on algebraic curves, due to D.V. Chudnovsky and G.V. Chudnovsky...
AbstractWe wish to answer the following question: p matrices Bi, of the same dimension, being given,...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...