---
res:
bibo_abstract:
- "A polynomial time algorithm to find generators of the lattice of all subfields
of a given number field was given in van Hoeij et al. (2013).\r\n\r\nThis article
reports on a massive speedup of this algorithm. This is primary achieved by our
new concept of Galois-generating subfields. In general this is a very small set
of subfields that determine all other subfields in a group-theoretic way. We compute
them by targeted calls to the method from van Hoeij et al. (2013). For an early
termination of these calls, we give a list of criteria that imply that further
calls will not result in additional subfields.\r\n\r\nFinally, we explain how
we use subfields to get a good starting group for the computation of Galois groups.@eng"
bibo_authorlist:
- foaf_Person:
foaf_givenName: Andreas-Stephan
foaf_name: Elsenhans, Andreas-Stephan
foaf_surname: Elsenhans
- foaf_Person:
foaf_givenName: Jürgen
foaf_name: Klüners, Jürgen
foaf_surname: Klüners
foaf_workInfoHomepage: http://www.librecat.org/personId=21202
bibo_doi: 10.1016/j.jsc.2018.04.013
bibo_volume: 93
dct_date: 2018^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/0747-7171
dct_language: eng
dct_publisher: Elsevier BV@
dct_subject:
- Computational Mathematics
- Algebra and Number Theory
dct_title: Computing subfields of number fields and applications to Galois group
computations@
...