146
click to vote
ANTS
15 years 10 months ago
1994 Springer 
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
144
click to vote
ANTS
15 years 10 months ago
1994 Springer
We propose a fast variant of the Gaussian algorithm for the reduction of two{ dimensional lattices for the l1; l2; and l1;norm. The algorithm runs in at most O(n M(B) logB) bit op...
131
click to vote
ANTS
15 years 10 months ago
1994 Springer
In this paper we give some computational results on the multiplicative orders of optimal normal basis generators in F2n over F2 for n 1200 whenever the complete factorization of 2...
|
Algorithms