The Complexity of Computing all Subfields of an Algebraic Number Field
classification
💻 cs.SC
math.NT
keywords
subfieldscomplexityfieldnumberalgebraiccomputecomputingextension
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.