论文信息 - On the Complexity of Computing Class Groups of Algebraic Number Fields

On the Complexity of Computing Class Groups of Algebraic Number Fields

Let n be a fixed natural number, feZ[x] a monic irreducible polynomial of degree n. Let F=Q(ρ) be the algebraic number field which is generated by a root ρ of f and assume that 1, ρ, ρ2, ..., ρn−1 is a Z-basis of the maximal order O of F. In this paper we describe an algorithm by which the class group Cl of F can be computed in D1+e binary operations where D denotes the discriminant of F.

Michael E. Pohst | Johannes A. Buchmann | J. Buchmann | M. Pohst

[1] Johannes A. Buchmann,et al. On Principal Ideal Testing in Algebraic Number Fields , 1987, J. Symb. Comput..

[2] Johannes Buchmann,et al. On the period length of the generalized Lagrange algorithm , 1987 .

[3] Donald E. Knuth,et al. Sorting and Searching , 1973 .

[4] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[5] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[6] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .

[7] Ravi Kannan,et al. Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

[8] Michael Pohst,et al. Algorithmic algebraic number theory , 1989, Encyclopedia of mathematics and its applications.

[9] H. C. Williams,et al. Continued fractions and number-theoretic computations , 1985 .

[10] J. Buchmann. On the computation of units and class numbers by a generalization of Lagrange's algorithm , 1987 .

[11] Leslie E. Trotter,et al. Hermite Normal Form Computation Using Modulo Determinant Arithmetic , 1987, Math. Oper. Res..

[12] D. Cantor,et al. A new algorithm for factoring polynomials over finite fields , 1981 .

[13] C. Siegel,et al. Abschätzung von Einheiten , 1979 .