Subexponential algorithms for class group and unit computations

Journal of Symbolic Computation

Volumn 24, Issue 3-4, 1997, Pages 433-441

  Cohen, H ^a   Diaz Y Diaz, F ^a   Olivier, M ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031234422     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0143     Document Type: Article

References (11)

1. Bach E. (1990). Explicit bounds for primality testing and related problems Math. Comp. 55 355-380
2. Bach E. (1996). Improved approximations for Euler products (to appear).
3. Buchmann J. (1990). Computing class groups and regulators in subexponential time preprint.
4. Buchmann J., Düllmann S. (1991). A probabilistic class group and regulator algorithm and its implementation Computational number theory, A. Petho, M. Pohst, H. Williams and H. Zimmer, eds, Walter de Gruyter.
5. Buchmann J., Lenstra H. (1991) Computing maximal orders and factoring over ℤp preprint
6. Cohen H. (1993). A course in computational algebraic number theory Graduate Texts in Maths 138 Springer-Verlag
7. Fincke U., Pohst M. (1985). Improved methods for calculating vectors of short length in a lattice including a complexity analysis Math. Comp. 44 463-71.
8. Friedman E. (1989). Analytic formulas for the regulator of a number field Invent. Math. 98 599-622
9. Hafner J., McCurley K. (1989). A rigorous subexponential algorithm for computation of class groups J. Amer. Math. Soc. 2 837-850
10. Hafner J., McCurley K. (1991). Asymptotically fast triangulation of matrices over rings SIAM J. Comput. 20 1068-1083
11. Zimmert R. (1981). Ideale kleiner Norm in Idealklassen und eine Regulatorabschätzung Invent. Math. 62 367-380