K. Belabas, M. van Hoeij, J. Klueners, A. Steel
Published 2004-09-27Version 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.
Computing the Length of Sum of Squares and Pythagoras Element in a Global Field
Diophantine definability of nonnorms of cyclic extensions of global fields
The $μ$-invariant change for abelian varieties over finite $p$-extensions of global fields
![QR code for arXiv:math/0409510 [math.NT]](http://oss.arxitics.com/images/favicon.svg)