A Course in Computational Algebraic Number Theory: 138 (Graduate Texts in Mathematics, 138) - Hardcover

Críticas

From the reviews:

H. Cohen

A Course in Computational Algebraic Number Theory

"With numerous advances in mathematics, computer science, and cryptography, algorithmic number theory has become an important subject. Undoubtedly, this book, written by one of the leading authorities in the field, is one of the most beautiful books available on the market."

―ACTA SCIENTIARUM MATHEMATICARUM

“This book is intended to provide material for a three-semester sequence, introductory, graduate course in computational algebraic number theory. ... The book is excellent. ... The book has 75 sections, making it suitable for a three-semester sequence. There are numerous exercises at all levels ... . The bibliography is quite comprehensive and therefore has intrinsic value in its own right. ... chapters bring the student to the frontiers of the field, covering elliptic curves, modern primality testing and modern factoring methods.” (Russell Jay Hendel, The Mathematical Association of America, January, 2011)

Reseña del editor

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.