"synopsis" may belong to another edition of this title.
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)
"About this title" may belong to another edition of this title.
Shipping:
£ 29.70
From Chile to U.S.A.
Book Description Dura. Condition: New. Dust Jacket Condition: Nuevo. No Aplica (illustrator). 0. This book, written by one of the leading authorities in the field, describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. A complete theoretical introduction is given for each subject, reducing prerequisites to a minimum. The detailed descrption of each algorithm allowa immediate computer implementation; numerous further hints for implementation are also provided. Many of the algorithms hace never been published or appear here for the first in book form. The first sever chapters lead the reader to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, and for elliptic curve computations. The last three chapters give a survey of factoring and primality testing methods, including a detailed description of the number-field sieve algorithm. The book ends with a description of available computer packages and some useful tables. It caontains a large number of exercises. OBSERVACI?N: La tapa trasera tiene un pequeño daño. 920 gr. Libro. Seller Inventory # 9780387556406LEA19513