The complexity of computing all subfields of an algebraic number field

摘要

For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. 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. (C) 2018 Elsevier Ltd. All rights reserved.