The complexity of computing all subfields of an algebraic number field

For a finite separable field extension , all subfields can be obtained by intersecting so-called of . In this work we present a way to quickly compute these intersections. If the number of subfields is high, then this leads to faster run times and an improved complexity.