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). |
Year | DOI | Venue |
---|---|---|
2019 | 10.1016/j.jsc.2018.04.013 | Journal of Symbolic Computation |
Keywords | Field | DocType |
Subfields,Galois group,Number fields,LLL | Discrete mathematics,Algebra,Galois group,Algebraic number field,Time complexity,Small set,Mathematics,Speedup,Computation | Journal |
Volume | ISSN | Citations |
93 | 0747-7171 | 0 |
PageRank | References | Authors |
0.34 | 8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Andreas-Stephan Elsenhans | 1 | 19 | 6.94 |
JüRgen KlüNers | 2 | 49 | 10.32 |