activity
19992018
most citedFactoring polynomials over global fields

11 citations · 11 across the 1 of their papers we have counts for

collaborators
Showing math.NTShow all

2 papers · 1 filter

math.NT2018

Modular Forms in Pari/GP

Karim Belabas, Henri Cohen

We give theoretical and practical information on the Pari/GP modular forms package available since the spring of 2018. Thanks to the use of products of two Eisenstein series, this…

math.NT2004★ 11 cited

Factoring polynomials over global fields

K. Belabas, M. van Hoeij, J. Klueners +1

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.