861 search results - page 82 / 173 » Faster integer multiplication |
106
Voted
SAS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
103
click to vote
WAOA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all ...
107
Voted
DATE
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper we present an hardware implementation of the RSA algorithm for public-key cryptography. The RSA algorithm consists in the computation of modular exponentials on larg...
111
Voted
ISLPED
2003
ACM
15 years 7 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
106
click to vote
CALC
2001
Springer
15 years 6 months ago
2001
Springer
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...