Algorithmic Algebraic Number Theory
Algorithmic Algebraic Number Theory
M. Pohst
H. Zassenhaus
H. Zassenhaus
November 1997
Paperback
9780521596695
AUD$148.14
exc GSTPaperback
USD
eBook
Now in paperback, this classic book is addressed to all lovers of number theory. On the one hand, it gives a comprehensive introduction to constructive algebraic number theory, and is therefore especially suited as a textbook for a course on that subject. On the other hand many parts go beyond an introduction and make the user familiar with recent research in the field. New methods which have been developed for experimental number theoreticians are included along with new and important results. Both computer scientists interested in higher arithmetic and those teaching algebraic number theory will find the book of value.
- Classic book
- Subject remains important
- Very affordable paperback
Product details
November 1997Paperback
9780521596695
516 pages
228 × 151 × 30 mm
0.73kg
Available
Table of Contents
- Preface
- List of symbols
- 1. Basics of constructive algebraic number theory
- 2. The group of an equation
- 3. Methods from the geometry of numbers
- 4. Embedding of commutative orders into the maximal order
- 5. Units in algebraic number fields
- 6. The class group of algebraic number fields
- Appendix
- Algorithms
- References
- Index.
