Sciweavers

ANTS
2008
Springer
110views Algorithms» more  ANTS 2008»
13 years 6 months ago
Computing Hilbert Class Polynomials
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 < ...
Juliana Belding, Reinier Bröker, Andreas Enge...
ISSAC
2009
Springer
269views Mathematics» more  ISSAC 2009»
13 years 11 months ago
On factorization of multivariate polynomials over algebraic number and function fields
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan