Sciweavers

6 search results - page 1 / 2
» ants 1994
Sort
View
ANTS
1994
Springer
150views Algorithms» more  ANTS 1994»
13 years 11 months ago
Analysis of a left-shift binary GCD algorithm
Jeffrey Shallit, Jonathan Sorenson
ANTS
1994
Springer
80views Algorithms» more  ANTS 1994»
13 years 11 months ago
On the difficulty of finding reliable witnesses
W. R. Alford, Andrew Granville, Carl Pomerance
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
13 years 11 months ago
The complexity of greatest common divisor computations
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
ANTS
1994
Springer
83views Algorithms» more  ANTS 1994»
13 years 11 months ago
On orders of optimal normal basis generators
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
MAAMAW
1994
Springer
13 years 11 months ago
What Ants Cannot Do
What is the relation between the complexity of agents and the complexity of the goals that they can achieve? It is argued on the basis of a fundamental conservation of complexity ...
Eric Werner