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
A course in computational algebraic number theory
โ Scribed by Henri Cohen
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Leaves
- 563
- Series
- Graduate Texts in Mathematics
- Edition
- 3rd, Corr. Print
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
One of the first of a new generation of books in mathematics that show the reader how to do large or complex computations using the power of computer algebra. It contains descriptions of 148 algorithms, which are fundamental for number theoretic calculations, in particular for computations related to algebraic number theory, elliptic curves, primality testing, lattices and factoring. For each subject there is a complete theoretical introduction. A detailed description of each algorithm is given allowing for immediate computer implementation. Many of the algorithms are new or appear for the first time in this book. A large number of exercises is also included.
๐ SIMILAR VOLUMES
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
<DIV>This graduate-level text provides coverage for a one-semester course in algebraic number theory. It explores the general theory of factorization of ideals in Dedekind domains as well as the number field case. Detailed calculations illustrate the use of Kummer's theorem on lifting of prime ideal
This is a text for a basic course in algebraic number theory.