ANTS
1998
Springer
13 years 8 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
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. We provide here a complete average
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. This paper describes a method for computing the fundamental unit and regulator of a purely cubic congruence function field of unit
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the on...
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O(...
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
Call a set of integers {b1, b2, . . . , bk} admissible if for any prime p, at least one congruence class modulo p does not contain any of the bi. Let (x) be the size of the largest...
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
