|
18
|
Proving primality in essentially quartic random time
– Daniel J. Bernstein
- 2003
|
|
119
|
Prime Numbers - A Computational Perspective
– R Crandall, C Pomerance
- 2000
|
|
23
|
Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
– F. Morain
- 2005
|
|
10
|
Efficient “quasi”deterministic primality test improving AKS. Available at http://www-math.uni-paderborn.de/~preda
– Preda Mihăilescu, Roberto M Avanzi
|
|
62
|
Almost All Primes Can be Quickly Certified
– Shafi Goldwasser, Joe Kilian
|
|
102
|
On distinguishing prime numbers from composite numbers
– Leonard M Adleman, Carl Pomerance, Robert S Rumely
- 1983
|
|
5
|
Algebra Engrg
– C Schneider, Appl
- 2005
|
|
3
|
On primes in arithmetic progressions. Tsukuba journal of mathematics 25(1
– Hiroshi Mikawa
- 2001
|
|
127
|
On Fast Multiplication of Polynomials Over Arbitrary Algebras
– David G. Cantor, Erich Kaltofen
- 1991
|
|
240
|
Approximate formulas for some functions of prime numbers
– J B Rosser, L Schoenfeld
- 1962
|
|
13
|
A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynomials
– Dima Grigoriev, Marek Karpinski
|
|
26
|
Symbolic-numeric sparse interpolation of multivariate polynomials
– Mark Giesbrecht
- 2006
|
|
45
|
Primality Testing And Abelian Varieties Over Finite Fields (Springer-Verlag
– L M Adleman, M-D A Huang
- 1992
|
|
25
|
The complexity of class polynomial computation via floating point approximations
– Andreas Enge
- 2006
|
|
760
|
A Course in Computational Algebraic Number Theory
– H Cohen
- 1993
|
|
154
|
Elliptic curves over finite fields and the computation of square roots mod p
– René Schoof
- 1985
|
|
7
|
Sharpening PRIMES is in P for a large family of numbers
– Pedro Berrizbeitia
- 2005
|
|
7
|
Cyclotomic primality proving — Recent developments
– P Mihăilescu
- 1998
|
|
138
|
Elliptic Curves And Primality Proving
– A. O. L. Atkin, F. Morain
- 1993
|
