A course in computational algebraic number theory

✍ Scribed by Cohen, Henri

Publisher: Springer
Year: 2011
Tongue: English
Leaves: 556
Series: Graduate texts in mathematics 130
Category: Library

⬇ Acquire This Volume

No coin nor oath required. For personal study only.

✦ Table of Contents

Fundamental Number-Theoretic Algorithms.- 2. Algorithms for Linear Algebra and Lattices.- 3. Algorithms on Polynomials.- 4. Algorithms for Algebraic Number Theory I.- 5. Algorithms for Quadratic Fields.- 6. Algorithms for Algebraic Number Theory II.- 7. Introduction to Elliptic Curves.- 8. Factoring in the Dark Ages.- 9. Modern Primality Tests.- 10. Modern Factoring Methods.- Appendix A. Packages for Number Theory.- Appendix B. Some Useful Tables.- B.1. Table of Class Numbers of Complex Quadratic Fields.- B.2. Table of Class Numbers and Units of Real Quadratic Fields.- B.3. Table of Class Numbers and Units of Complex Cubic Fields.- B.4. Table of Class Numbers and Units of Totally Real Cubic Fields.- B.5. Table of Elliptic Curves.

✦ Subjects

Algebraic number theory

📜 SIMILAR VOLUMES

A Course in Computational Algebraic Numb

📁 A Course in Computational Algebraic Number Theory

✍ Henri Cohen 📂 Library 📅 1996 🏛 Springer Berlin Heidelberg 🌐 English

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 numb

📁 A course in computational algebraic number theory

✍ Henri Cohen 📂 Library 📅 1993 🏛 Springer 🌐 English

A course in computational algebraic numb

📁 A course in computational algebraic number theory

✍ Henri Cohen 📂 Library 📅 1993 🏛 Springer 🌐 English

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 t

A Course in Computational Algebraic Numb

📁 A Course in Computational Algebraic Number Theory - Errata (2000)

✍ Henri Cohen 📂 Library 📅 1993 🏛 Springer 🌐 English

A Course in Algebraic Number Theory

📁 A Course in Algebraic Number Theory

✍ Robert B. Ash 📂 Library 📅 2010 🏛 Dover Publications 🌐 English

<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

A Course In Algebraic Number Theory

📁 A Course In Algebraic Number Theory

✍ Ash R.B. 📂 Library 📅 2003 🌐 English

This is a text for a basic course in algebraic number theory.