Algorithms | Sciweavers

25

click to vote

ANTS
1998
Springer

119views Algorithms» more ANTS 1998»

A Comparison of Direct and Indirect Methods for Computing Selmer Groups of an Elliptic Curve

14 years 3 months ago

Download www.hpl.hp.com

Z. Djabri, Nigel P. Smart

claim paper

Read More »

34

click to vote

ANTS
1998
Springer

135views Algorithms» more ANTS 1998»

Fast Multiprecision Evaluation of Series of Rational Numbers

14 years 3 months ago

Download www.ginac.de

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

claim paper

Read More »

34

click to vote

ANTS
1998
Springer

114views Algorithms» more ANTS 1998»

Dense Admissible Sets

14 years 3 months ago

Download www.ccrwest.org

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

claim paper

Read More »

35

click to vote

ANTS
1998
Springer

138views Algorithms» more ANTS 1998»

Parallel Implementation of Schönhage's Integer GCD Algorithm

14 years 3 months ago