ISBN: 9780387556406 - a course in computational algebraic number theory (5 resultados)

Paperback. Condición: Very Good. 3rd, Corr. Print. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Condición: very_good. Book is in very good condition and may include minimal underlining highlighting. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service.

Condición: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Hardcover. Condición: Good. No Dust Jacket. First Edition. An ex-library copy in original yellow and white hard covers. The usual ex-libris markings. The binding is sound, the text is clean/unmarked, and there is little cover wear. No dust jacket, apparently as issued. Book.

Dura. Condición: New. Estado de la sobrecubierta: Nuevo. 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. No Aplica (ilustrador). Libro.…