Sciweavers

ANTS
1998
Springer
93views Algorithms» more  ANTS 1998»
14 years 3 months ago
Evaluation of Linear Relations between Vectors of a Lattice in Euclidean Space
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...
Igor A. Semaev
ANTS
1998
Springer
120views Algorithms» more  ANTS 1998»
14 years 3 months ago
The Complete Analysis of the Binary Euclidean Algorithm
Abstract. We provide here a complete average
Brigitte Vallée
ANTS
1998
Springer
139views Algorithms» more  ANTS 1998»
14 years 3 months ago
Generating Arithmetically Equivalent Number Fields with Elliptic Curves
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...
Bart de Smit
ANTS
1998
Springer
112views Algorithms» more  ANTS 1998»
14 years 3 months ago
Unit Computation in Purely Cubic Function Fields of Unit Rank 1
Abstract. This paper describes a method for computing the fundamental unit and regulator of a purely cubic congruence function field of unit
Renate Scheidler, Andreas Stein
ANTS
1998
Springer
123views Algorithms» more  ANTS 1998»
14 years 3 months ago
Primality Proving Using Elliptic Curves: An Update
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...
François Morain
ANTS
1998
Springer
82views Algorithms» more  ANTS 1998»
14 years 3 months ago
Timing Analysis of Targeted Hunter Searches
John W. Jones, David P. Roberts
ANTS
1998
Springer
135views Algorithms» more  ANTS 1998»
14 years 3 months ago
Fast Multiprecision Evaluation of Series of Rational Numbers
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(...
Bruno Haible, Thomas Papanikolaou
ANTS
1998
Springer
114views Algorithms» more  ANTS 1998»
14 years 3 months ago
Dense Admissible Sets
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...
Daniel M. Gordon, Eugene R. Rodemich