arXiv · 1204.1300
Improvements in the computation of ideal class groups of imaginary quadratic number fields
Abstract
We investigate improvements to the algorithm for the computation of ideal class groups described by Jacobson in the imaginary quadratic case. These improvements rely on the large prime strategy and a new method for performing the linear algebra phase. We achieve a significant speed-up and are able to compute ideal class groups with discriminants of 110 decimal digits in less than a week.
Explore related subjects
Keep this discovery
Jean-François Biasse. 2012-04-05. Improvements in the computation of ideal class groups of imaginary quadratic number fields. https://arxiv.org/abs/1204.1300
Cite the original work for its findings. Save a collection to share your selection of sources.