Abstract
Using the theory of binary pseudo-quadratic forms over Z developed in [5], we sketch an algorithm for computing the relative class group of quadratic extensions. We end by a striking example which can be treated orders of magnitude faster using the relative method than using the absolute one.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.-M. Bergé and J. Martinet: Notions relatives de regulateurs et de hauteurs. Acta Arith. 54, No. 2, (1989) 155–170
H. Cohen: A Course in Computational Algebraic Number Theory. GTM 138, (1993) Springer-Verlag
H. Cohen, F. Diaz y Diaz and M. Olivier: Subexponential Algorithms for Class and Unit Group Computations. J. Symb. Comp. 24 (1997) 433–441
H. Cohen, F. Diaz y Diaz and M. Olivier: Algorithms for Finite Abelian Groups. Submitted to J. Symb. Comp. (1997)
H. Cohen, F. Diaz y Diaz and M. Olivier: Pseudo-quadratic forms and their applications. Preprint (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, H., Diaz y Diaz, F., Olivier, M. (1998). Computation of relative quadratic class groups. In: Buhler, J.P. (eds) Algorithmic Number Theory. ANTS 1998. Lecture Notes in Computer Science, vol 1423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054882
Download citation
DOI: https://doi.org/10.1007/BFb0054882
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64657-0
Online ISBN: 978-3-540-69113-6
eBook Packages: Springer Book Archive