861 search results - page 15 / 173 » Faster integer multiplication |
MST
2007
13 years 7 months ago
2007
We use lattice reduction to obtain a polynomial time algorithm for recovering an integer (up to a multiple) given multiples of its residues modulo sufficiently many primes, when t...
ARITH
2005
IEEE
14 years 1 months ago
2005
IEEE
— The Residue Logarithmic Number System (RLNS) represents real values as quantized logarithms which, in turn, are represented using the Residue Number System (RNS). Compared to t...
SACRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of invers...
PLDI
2000
ACM
14 years 3 days ago
2000
ACM
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An