On the computation of the class number of an algebraic number field

Johannes Buchmann, H. C. Williams
1989 Mathematics of Computation  
It is shown how the analytic class number formula can be used to produce an algorithm which efficiently computes the class number h of an algebraic number field F. The method assumes the truth of the Generalized Riemann Hypothesis in order to estimate the residue of the Dedekind zeta function of F at s = 1 sufficiently well that h can be determined unambiguously. Given the regulator R of F and a known divisor h* of h, it is shown that this technique will produce the value of h in
more » ... h in 0(\dp\1+e/(h*R)2) elementary operations, where djr is the discriminant of F. Thus, if h < Idpl1/8, then the complexity of computing h (with h* = 1) is 0(|df \l'4+£).
doi:10.1090/s0025-5718-1989-0979937-4 fatcat:wqowecyaarab3jxd64w3kgjedm