5 search results - page 1 / 1 » Computing Hilbert class polynomials with the Chinese remaind... |
MOC
2011
13 years 5 months ago
2011
ANTS
2008
Springer
14 years 26 days ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
APPT
2009
Springer
14 years 2 months ago
2009
Springer
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently using the Number Theoretic transform (NTT) on Graphics Processing Units (GPU). The...
CIE
2006
Springer
14 years 24 days ago
2006
Springer
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...