Computational class field theory
arXiv:0802.3843
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.
arXiv comment33 pages. To appear in "Surveys in algorithmic number theory" (Cambridge University Press, 2008)