Amazon.com: Advanced Topics in Computional Number Theory (Graduate Texts in Mathematics) (9780387987279): Henri Cohen: Books
Advanced Topics in Computional Number Theory and over one million other books are available for Amazon Kindle. Learn more


or
Sign in to turn on 1-Click ordering.
Sell Back Your Copy
For a $2.93 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
Advanced Topics in Computional Number Theory (Graduate Texts in Mathematics)
 
 
Start reading Advanced Topics in Computional Number Theory on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Advanced Topics in Computional Number Theory (Graduate Texts in Mathematics) [Hardcover]

Henri Cohen (Author)
5.0 out of 5 stars  See all reviews (1 customer review)

List Price: $74.95
Price: $60.14 & this item ships for FREE with Super Saver Shipping. Details
You Save: $14.81 (20%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Usually ships within 9 to 12 days.
Ships from and sold by Amazon.com. Gift-wrap available.
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Kindle Edition $54.13  
Hardcover $60.14  

Book Description

November 30, 1999 0387987274 978-0387987279 1
Written by an authority with great practical and teaching experience in the field, this book addresses a number of topics in computational number theory. Chapters one through five form a homogenous subject matter suitable for a six-month or year-long course in computational number theory. The subsequent chapters deal with more miscellaneous subjects.

Frequently Bought Together

Advanced Topics in Computional Number Theory (Graduate Texts in Mathematics) + A Course in Computational Algebraic Number Theory (Graduate Texts in Mathematics) + Number Theory: Volume I: Tools and Diophantine Equations (Graduate Texts in Mathematics)
Price For All Three: $197.06

Some of these items ship sooner than the others. Show details

Buy the selected items together
  • Usually ships within 9 to 12 days.
    Ships from and sold by Amazon.com.
    This item ships for FREE with Super Saver Shipping. Details

  • A Course in Computational Algebraic Number Theory (Graduate Texts in Mathematics) $71.97

    Usually ships within 9 to 14 days.
    Ships from and sold by Amazon.com.
    This item ships for FREE with Super Saver Shipping. Details

  • Number Theory: Volume I: Tools and Diophantine Equations (Graduate Texts in Mathematics) $64.95

    In Stock.
    Ships from and sold by Amazon.com.
    This item ships for FREE with Super Saver Shipping. Details



Editorial Reviews

Review

"Das vorliegende Buch ist eine Fortsetzung des bekannten erkes "A Course in Computational Algebraic Number Theory" (Graduate Texts in Mathematics 138) desselben Autors. ... So ist das vorliegende Buch ein sehr umfängliches Nachschlagewerk zur algorithmischen Zahlentheorie, das zusammen mit dem ersten Buch des Autors sicherlich eine Standard-Referenz für zahlentheoretische Algorithmen darstellen wird." Internationale Mathematische Nachrichten, Nr. 187, August 2001

Product Details

  • Hardcover: 593 pages
  • Publisher: Springer; 1 edition (November 30, 1999)
  • Language: English
  • ISBN-10: 0387987274
  • ISBN-13: 978-0387987279
  • Product Dimensions: 9.2 x 6.6 x 1.2 inches
  • Shipping Weight: 2.2 pounds (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #846,119 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

1 Review
5 star:
 (1)
4 star:    (0)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
5.0 out of 5 stars (1 customer review)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

2 of 3 people found the following review helpful:
5.0 out of 5 stars A first class job, just as in the first volume, August 24, 2001
This review is from: Advanced Topics in Computional Number Theory (Graduate Texts in Mathematics) (Hardcover)
The author continues his excellent overview of computational number theory in this book. And, as in the first volume, the writing is first-rate and gives the reader a comprehensive overview of the more advanced algorithms in the subject. Contrary to the first volume, I have not used many of the algorithms in this book and cannot attest to their quality, but the author gives the detailed background on each of them, enhancing their credibility. I read this book mostly to gain more insight into algebraic geometry and its connection with coding theory and cryptography. The following algorithms were ones that I found helpful and interesting but only a few of which I coded myself: (1) The algorithm for generating a random element from an ideal. (2) The compositum of two number fields (3) Valuation of a prime ideal. (4)Ideal factorization. (5)Smith normal form for finite groups. (6) Quotient of groups. (7) Group extensions. (8) Right four-term exact sequences. (9) Image and inverse image of a subgroup. (10)Subgroups with prime index. (11) Solving linear systems in integers. (12) Algorithms involving p-adic logarithms. (13) Computation of the Dedekind eta-function. (14) Unramified Abelian extensions using complex multiplication. (15) Computation of quasi-periods for elliptic functions. (16) Computation of the sigma-function for an elliptic curve.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
First Sentence:
The easiest way to start studying number fields is to consider them per se, as absolute extensions of Q; this is, for example, what we have done in [Coh0]. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
principal ideal algorithm, integral ideal coprime, relative defining polynomial, complex cubic fields, relative class groups, squarefree ideals, class field corresponding, discrete logarithm algorithm, relative quadratic extensions, sextic fields, ray class groups, totally real case, cubic number field, class group computations, ray class fields, ideals coprime, quartic fields, small discriminant, prime ideal decomposition, binary cubic forms, real cubic fields, discriminant ideal, gamma product, congruence subgroup, quartic case
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Prove Proposition, Algorithmic Characterization of the Set, Basic Algorithms, Compute Hessian
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:





Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product).
 

Your tags: Add your first tag
 

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!

Create a Listmania! list

So You'd Like to...



Look for Similar Items by Category


Look for Similar Items by Subject