arXiv · 1810.11396
On the complexity of class group computations for large degree number fields
Abstract
In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity analysis and identify the optimal parameters to reduce the runtime. We make use of the classes $\mathcal D$ defined in [GJ16] for classifying the fields according to the size of the extension degree and prove that they enable to describe all the number fields.
Explore related subjects
Keep this discovery
Alexandre Gélin. 2018-10-26. On the complexity of class group computations for large degree number fields. https://arxiv.org/abs/1810.11396
Cite the original work for its findings. Save a collection to share your selection of sources.