A course in computational algebraic number theory / Henri Cohen
Type de document : MonographieCollection : Graduate texts in mathematics, 138Langue : anglais.Pays: Allemagne.Éditeur : Berlin : Springer, 1993Description : 1 vol. (XXII-534 p.) ; 24 cmISBN: 9783540556404.ISSN: 0072-5285.Bibliographie : Bibliogr. p. [517]-528. Index.Sujet MSC : 11Rxx, Number theory - Algebraic number theory: global fields11Y11, Computational number theory, Primality
11Y05, Computational number theory, Factorization
11Y16, Computational number theory, Number-theoretic algorithms; complexity
11Y40, Computational number theory, Algebraic number theory computationsEn-ligne : Springerlink | Zentralblatt | MathSciNet Item type:
Monographie
| Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|
| CMI Salle R | 11 COH (Browse shelf(Opens below)) | Available | 11152-01 |
“A course in computational algebraic number theory” contains 148 algorithms, which were all up-to-date when the book came out. Hence, this book is the source for number theorists wishing to learn about a special method and/or implement an algorithm without studying the theory in greater detail. Among these algorithms, many are new or improved. In most cases, their analysis and their complexity are given (not the complexity of the problem, as stated in the preface) and, most importantly, valuable remarks on implementations. Here one sees the great experience of the author, the founder of the package PARI.
The book begins with a chapter devoted to the most important routines from elementary number theory. It is followed by one on algorithms from linear algebra and lattice theory. Especially important are the sections on Hermite and Smith normal forms and lattice basis reduction algorithms. ... (Zentralblatt)
Bibliogr. p. [517]-528. Index
There are no comments on this title.