Course in Computational Algebraic Number Theory
Our rough guess is there are 139,250 words in this book.
At a pace averaging 250 words per minute, this book will take 9 hours and 17 minutes to read. With a half hour per day, this will take 19 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
139,250 words, Guess
Page Count
557 pages
Identifiers
- ISBN-139783662029459
- ISBN-103662029456
- Better World Books9783662029459
- Open LibraryOL35792634M
Classifications
- LCCQA1-939
Description
This book describes 148 algorithms which are fundamental for number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters lead the reader 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. 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. The book also contains a large number of exercises. Written by an authority in the field, and one with great practical and teaching experience it is sure to become the standard and indispensable reference on the subject.
Subjects
Other Editions
- Course in Computational Algebraic Number Theory
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!