A Course in Computational Algebraic Number Theory (Hardcover, 1st ed. 1993. 4th printing 2000)

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Graduate Texts in Mathematics, 138
Release date:	August 2000
First published:	July 2000
Authors:	Henri Cohen
Dimensions:	235 x 155 x 42mm (L x W x T)
Format:	Hardcover
Pages:	536
Edition:	1st ed. 1993. 4th printing 2000
ISBN-13:	978-3-540-55640-4
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Algebra > General Books > Science & Mathematics > Mathematics > Number theory > General
LSN:	3-540-55640-0
Barcode:	9783540556404

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!