Range-reduction is a key point for getting accurate elementary function routines. We introduce a new algorithm that is fast for input arguments belonging to the most common domains, yet accurate over the full double-precision range
International audienceComputer platforms need implementations of elementary functions (exponential, ...
AbstractWe present two new algorithms for the range-efficient F0 estimating problem and improve the ...
This paper proposes a fast algorithm for Boolean matching of completely specified Boolean functions....
(eng) Range reduction is a key point for getting accurate elementary function routines. We introduce...
Range reduction is a key point for getting accurate elementary function routines. We introduce a new...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
A new range reduction algorithm, called ModularRange Reduction (MRR), briefly introduced by the auth...
In several cases, the input argument of an elementary function evaluation is given bit-serially, mos...
Article dans revue scientifique avec comité de lecture.International audienceIn several cases, the i...
(eng) In several cases, the input argument of an elementary function evaluation is given bit-seriall...
AbstractIn a recent paper by Aberth and Schaefer (1992), it was shown how an implementation of range...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
Sometimes, a function f of n variables can be represented as a composition of two functions of fewer...
Exportado OPUSMade available in DSpace on 2019-08-11T09:38:42Z (GMT). No. of bitstreams: 1 raphaeler...
International audienceComputer platforms need implementations of elementary functions (exponential, ...
AbstractWe present two new algorithms for the range-efficient F0 estimating problem and improve the ...
This paper proposes a fast algorithm for Boolean matching of completely specified Boolean functions....
(eng) Range reduction is a key point for getting accurate elementary function routines. We introduce...
Range reduction is a key point for getting accurate elementary function routines. We introduce a new...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
A new range reduction algorithm, called ModularRange Reduction (MRR), briefly introduced by the auth...
In several cases, the input argument of an elementary function evaluation is given bit-serially, mos...
Article dans revue scientifique avec comité de lecture.International audienceIn several cases, the i...
(eng) In several cases, the input argument of an elementary function evaluation is given bit-seriall...
AbstractIn a recent paper by Aberth and Schaefer (1992), it was shown how an implementation of range...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
Sometimes, a function f of n variables can be represented as a composition of two functions of fewer...
Exportado OPUSMade available in DSpace on 2019-08-11T09:38:42Z (GMT). No. of bitstreams: 1 raphaeler...
International audienceComputer platforms need implementations of elementary functions (exponential, ...
AbstractWe present two new algorithms for the range-efficient F0 estimating problem and improve the ...
This paper proposes a fast algorithm for Boolean matching of completely specified Boolean functions....
DOI
Add to ORKG