Results 1 
2 of
2
Algorithms in algebraic number theory
 Bull. Amer. Math. Soc
, 1992
"... Abstract. In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has been done and, more importantly, what remains to ..."
Abstract

Cited by 55 (4 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has been done and, more importantly, what remains to be done in the area. We hope to show that the study of algorithms not only increases our understanding of algebraic number fields but also stimulates our curiosity about them. The discussion is concentrated of three topics: the determination of Galois groups, the determination of the ring of integers of an algebraic number field, and the computation of the group of units and the class group of that ring of integers. 1.
On the class number of cyclic . . .
, 1999
"... This draft is a contribution to the description of the prime factors of the class number of a cyclic extension K/Q: • An example of the results obtained in the first approach is: Let K/Q be a cyclic extension with [K: Q] = g. Let g = 2γ ∏m j=1 gγj ..."
Abstract
 Add to MetaCart
This draft is a contribution to the description of the prime factors of the class number of a cyclic extension K/Q: • An example of the results obtained in the first approach is: Let K/Q be a cyclic extension with [K: Q] = g. Let g = 2γ ∏m j=1 gγj