Computational class field theory
Number Theory
2021-03-30 v2
Abstract
Class field theory furnishes an intrinsic description of the abelian extensions of a number field that is in many cases not of an immediate algorithmic nature. We outline the algorithms available for the explicit computation of such extensions.
Cite
@article{arxiv.0802.3843,
title = {Computational class field theory},
author = {Henri Cohen and Peter Stevenhagen},
journal= {arXiv preprint arXiv:0802.3843},
year = {2021}
}
Comments
33 pages. To appear in "Surveys in algorithmic number theory" (Cambridge University Press, 2008)