1484 search results - page 50 / 297 » Ants meeting algorithms |
ANTS
1998
Springer
14 years 2 months ago
1998
Springer
We prove that to find a nontrivial integer linear relation between vectors of a lattice L IRn , whose euclidean length is at most M, one needs O n5+ (ln Mn/)1+ binary operations f...
ANTS
1994
Springer
14 years 2 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...
ANTS
1994
Springer
14 years 2 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...
ANTS
2010
Springer
14 years 2 months ago
2010
Springer
: We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root r and an integer t in the interval [1, p − 1] with logr t = t. Here, logr is the d...
ANTS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We show that a specific even unimodular lattice of dimension 80, first investigated by Schulze-Pillot and others, is extremal (i.e., the minimal nonzero norm is 8). Thi...