128 search results - page 4 / 26 » Fast Integer Multiplication using Modular Arithmetic |
ICFP
1997
ACM
13 years 11 months ago
1997
ACM
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
FFA
2010
13 years 4 months ago
2010
Let p be prime and Zpn a degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast deterministic algorithms for common o...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we describe some certified algorithms for exact real arithmetic based on co-recursion. Our work is based on previous experiences using redundant digits of base 2 but ...
COMPGEOM
1997
ACM
13 years 11 months ago
1997
ACM
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
ARITH
2007
IEEE
14 years 1 months ago
2007
IEEE