A Course in Computational Algebraic Number Theory /

This book describes 148 algorithms which are fundamental for number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters lead the reader to the heart of current research in computational...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Cohen, Henri
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg, 1993.
Colección:Graduate texts in mathematics ; 138.
Temas:
Mathematics.
Computer software.
Algebra > Data processing.
Algorithms.
Number theory.
Mathematics
Software
Algorithms
Mathématiques.
Logiciels.
Algèbre > Informatique.
Algorithmes.
Théorie des nombres.
software.
algorithms.
Algebra > Data processing
Computer software
Number theory
Acceso en línea:Texto completo
Tabla de Contenidos:
  • 1. 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.

Ejemplares similares