We describe a unified framework to search for optimal formulae evaluating bilinear --- or quadratic --- maps. This framework applies to polynomial multiplication and squaring, finite field arithmetic, matrix multiplication, etc. We then propose a new algorithm to solve problems in this unified framework. With an implementation of this algorithm, we prove the optimality of various published upper bounds, and find improved upper bounds
AbstractFrom an interpolation method on algebraic curves, due to D.V. Chudnovsky and G.V. Chudnovsky...
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provid...
AbstractWe present a method for multiplication in finite fields which gives multiplication algorithm...
International audienceWe describe a unified framework to search for optimal formulae evaluating bili...
In 2012, Barbulescu, Detrey, Estibals and Zimmermann proposed a new framework to exhaustively search...
AbstractAlthough general theories are beginning to emerge in the area of automata based complexity t...
AbstractWe propose two exhaustive search-type methods for the construction of Karatsuba-like algorit...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
AbstractAn important class of problems in arithmetic complexity is that of computing a set of biline...
AbstractWe wish to answer the following question: p matrices Bi, of the same dimension, being given,...
Since 1960 and the result of Karatsuba, we know that the complexity of the multiplication (of intege...
AbstractWe present several bilinear algorithms for the acceleration of multiplication of n X n matri...
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 ...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
AbstractFrom an interpolation method on algebraic curves, due to D.V. Chudnovsky and G.V. Chudnovsky...
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provid...
AbstractWe present a method for multiplication in finite fields which gives multiplication algorithm...
International audienceWe describe a unified framework to search for optimal formulae evaluating bili...
In 2012, Barbulescu, Detrey, Estibals and Zimmermann proposed a new framework to exhaustively search...
AbstractAlthough general theories are beginning to emerge in the area of automata based complexity t...
AbstractWe propose two exhaustive search-type methods for the construction of Karatsuba-like algorit...
AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an...
AbstractAn important class of problems in arithmetic complexity is that of computing a set of biline...
AbstractWe wish to answer the following question: p matrices Bi, of the same dimension, being given,...
Since 1960 and the result of Karatsuba, we know that the complexity of the multiplication (of intege...
AbstractWe present several bilinear algorithms for the acceleration of multiplication of n X n matri...
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 ...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
AbstractFrom an interpolation method on algebraic curves, due to D.V. Chudnovsky and G.V. Chudnovsky...
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provid...
AbstractWe present a method for multiplication in finite fields which gives multiplication algorithm...