Higher fields of norms and -modules.
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a -adic factorization method based on Newton polygons of higher order. The running-time and memory requirements of the algorithm appear to be very good.