L'édition de cet ISBN n'est malheureusement plus disponible.
Afficher les exemplaires de cette édition ISBNLes informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Frais de port :
EUR 34,57
De Chili vers Etats-Unis
Description du livre Dura. Etat : New. Etat de la jaquette : Nuevo. No Aplica (illustrateur). 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. N° de réf. du vendeur 9780387556406LEA19513