Research Catalog
Algorithmic algebraic number theory
- Title
- Algorithmic algebraic number theory / M. Pohst, H. Zassenhaus.
- Author
- Pohst, M.
- Publication
- Cambridge [England] ; New York : Cambridge University Press, 1989.
Items in the Library & Off-site
Filter by
1 Item
| Status | Format | Access | Call Number | Item Location |
|---|---|---|---|---|
| Text | Use in library | QA247 .P58 1989 | Off-site |
Details
- Additional Authors
- Zassenhaus, Hans.
- Description
- xiv, 465 pages; 25 cm.
- Summary
- 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.
- Series Statement
- Encyclopedia of mathematics and its applications
- Uniform Title
- Encyclopedia of mathematics and its applications
- Subject
- Bibliography (note)
- Includes bibliographical references and index.
- Contents
- Machine derived contents note: 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.
- ISBN
- 0521330602
- 9780521330602
- 0521596696
- 9780521596695
- LCCN
- 88002960
- OCLC
- ocm17551622
- 17551622
- SCSB-1732265
- Owning Institutions
- Princeton University Library