11 citations · 11 across the 3 of their papers we have counts for
Showing math.NTShow all
2 papers · 1 filter
math.NT2004
Solving conics over Q(t1,..,tk)
Mark van Hoeij
Let K = Q(t1,..,tk) and a,b,c in K. We give a simple algorithm to find, if it exists, X,Y,Z in K, not all zero, for which aX^2 + bY^2 + cZ^2 = 0.
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.