ANTS 1994 | Sciweavers

20

click to vote

ANTS
1994
Springer

150views Algorithms» more ANTS 1994»

Analysis of a left-shift binary GCD algorithm

13 years 8 months ago

Download etd.lib.nsysu.edu.tw

Jeffrey Shallit, Jonathan Sorenson

claim paper

Read More »

10

click to vote

ANTS
1994
Springer

92views Algorithms» more ANTS 1994»

The complexity of greatest common divisor computations

13 years 8 months ago

Download dimacs.rutgers.edu

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...

Bohdan S. Majewski, George Havas

claim paper

Read More »

13

click to vote

ANTS
1994
Springer

105views Algorithms» more ANTS 1994»

A fast variant of the Gaussian reduction algorithm

13 years 8 months ago

Download www.csie.nuk.edu.tw

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...

Michael Kaib

claim paper

Read More »

12

click to vote

ANTS
1994
Springer

83views Algorithms» more ANTS 1994»

On orders of optimal normal basis generators

13 years 8 months ago

Download www.math.clemson.edu

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...

Shuhong Gao, Scott A. Vanstone

claim paper

Read More »

10

click to vote

ANTS
1994
Springer

80views Algorithms» more ANTS 1994»

On the difficulty of finding reliable witnesses

13 years 8 months ago

Download www.math.dartmouth.edu

W. R. Alford, Andrew Granville, Carl Pomerance

claim paper