AbstractThe approximate evaluation with a given precision of matrix and polynomial products is performed using modular arithmetic. The resulting algorithms are numerically stable. At the same time they are as fast as or faster than the algorithms with arithmetic operations over real or complex numbers
International audienceWe present algorithms to perform modular polynomial multiplication or modular ...
Fix pairwise coprime positive integers . We propose representing integers modulo , where is any posi...
International audienceMost numerical algorithms are designed for single or double precision oating p...
AbstractThe approximate evaluation with a given precision of matrix and polynomial products is perfo...
AbstractThe numbers of bit operations (bt) required for matrix multiplication (MM), matrix inversion...
AbstractThe action of commutativity and approximation is analyzed for some problems in Computational...
To appear in Mathematics of Computation.We analyse and compare the complexity of several algorithms ...
We survey and unify recent results on the existence of accurate algorithms for evaluating multivaria...
Abstract. We present an asymptotically fast algorithm for the numerical evaluation of modular functi...
International audienceWe propose an effi cient hardware-oriented method for evaluating complex polyn...
Four problems are considered: 1) from an n-precision integer compute its residues modulo n single pr...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
AbstractThe complexity of evaluating integers and polynomials is studied. A new model is proposed fo...
AbstractBini’s approximate formula (or border rank) for matrix multiplicationachieves a better compl...
AbstractThe aim of this work is to decrease the bit precision required in computations without affec...
International audienceWe present algorithms to perform modular polynomial multiplication or modular ...
Fix pairwise coprime positive integers . We propose representing integers modulo , where is any posi...
International audienceMost numerical algorithms are designed for single or double precision oating p...
AbstractThe approximate evaluation with a given precision of matrix and polynomial products is perfo...
AbstractThe numbers of bit operations (bt) required for matrix multiplication (MM), matrix inversion...
AbstractThe action of commutativity and approximation is analyzed for some problems in Computational...
To appear in Mathematics of Computation.We analyse and compare the complexity of several algorithms ...
We survey and unify recent results on the existence of accurate algorithms for evaluating multivaria...
Abstract. We present an asymptotically fast algorithm for the numerical evaluation of modular functi...
International audienceWe propose an effi cient hardware-oriented method for evaluating complex polyn...
Four problems are considered: 1) from an n-precision integer compute its residues modulo n single pr...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
AbstractThe complexity of evaluating integers and polynomials is studied. A new model is proposed fo...
AbstractBini’s approximate formula (or border rank) for matrix multiplicationachieves a better compl...
AbstractThe aim of this work is to decrease the bit precision required in computations without affec...
International audienceWe present algorithms to perform modular polynomial multiplication or modular ...
Fix pairwise coprime positive integers . We propose representing integers modulo , where is any posi...
International audienceMost numerical algorithms are designed for single or double precision oating p...
DOI
Add to ORKG