Abstract
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory requirements of the algorithm appear to be very good.
Original language | English |
---|---|
Pages (from-to) | 667-696 |
Journal | Journal de Theorie des Nombres de Bordeaux |
Volume | 23 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1 Jan 2011 |