Skip to main content
Book Chapter

Computational Class Field Theory

  • Cohen H
DOI: 10.1007/978-1-4419-8489-0_4
N/ACitations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

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

CITATION STYLE

APA

Cohen, H. (2000). Computational Class Field Theory (pp. 163–222). https://doi.org/10.1007/978-1-4419-8489-0_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free