Modern Computer Algebra / Edition 3

Hardcover (Print)
Buy New
Buy New from BN.com
$103.81
Used and New from Other Sellers
Used and New from Other Sellers
from $91.97
Usually ships in 1-2 business days
(Save 23%)
Other sellers (Hardcover)
  • All (13) from $91.97   
  • New (9) from $103.24   
  • Used (4) from $91.97   

Overview

Computer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the 'bible of computer algebra', gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany one- or two-semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, cryptography, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text. In this third edition, errors have been corrected and much of the Fast Euclidean Algorithm chapter has been renovated.

Read More Show Less

Editorial Reviews

From the Publisher
"I have to say that not only can one apply the book as a flexible textbook for many courses, but its comprehensiveness and clear style also make it an excellent reference text for computer science researchers and grad[uate] students, and anyone else interested in developing exact solution codes."
Alexander Tzanov, Computing Reviews
From The Critics
Reviews of previous editions: 'Wow! What a beautifully produced book, and what a wealth of information.' Don Knuth, Stanford University, California

'… this lively and exciting volume represents the state of the art in textbooks on computer algebra. Every student and instructor in this area will want a copy.' Jeffrey O. Shallit, Mathematical Reviews

'I find the quality of this book really exceptional …' Zentralblatt für Mathematik

'This book is a delight: I heartily recommend it.' Alistair Fitt, London Mathematical Society Newsletter

'On each page I can feel [the authors'] thorough understanding and love for the subject and [their] uncompromising scholarship in presenting this story. A masterpiece.' Erich Kaltofen, North Carolina State University

'I predict it will be a major success.' Steve Cook, University of Toronto

'It's really an impressive work. I'm sure it will become a reference for computer algebra algorithms, and stay it for a long time. Such a reference book was really missing.' Paul Zimmermann, Universite de Nancy, France

'I think it's a most successful balance of intuition, rigorous mathematics, interesting and beautiful applications and completeness. The extensive collection of exercises makes it into an ideal textbook for the use in a graduate course.' Ton Levelt, Radboud University Nijmegen

Read More Show Less

Product Details

  • ISBN-13: 9781107039032
  • Publisher: Cambridge University Press
  • Publication date: 4/30/2013
  • Edition description: New Edition
  • Edition number: 3
  • Pages: 815
  • Sales rank: 1,051,251
  • Product dimensions: 6.97 (w) x 10.00 (h) x 1.50 (d)

Meet the Author

Joachim von zur Gathen has a PhD from Universität Zürich and has taught at the University of Toronto and the University of Paderborn. He is currently a professor at the Bonn-Aachen International Center for Information Technology (B-IT) and the Department of Computer Science at Universität Bonn.

Jürgen Gerhard has a PhD from Universität Paderborn. He is now Director of Research at Maplesoft in Canada, where he leads research collaborations with partners in Canada, France, Russia, Germany, the USA and the UK, as well as a number of consulting projects for global players in the automotive industry.

Read More Show Less

Table of Contents

Introduction; 1. Cyclohexane, cryptography, codes, and computer algebra; Part I. Euclid: 2. Fundamental algorithms; 3. The Euclidean Algorithm; 4. Applications of the Euclidean Algorithm; 5. Modular algorithms and interpolation; 6. The resultant and gcd computation; 7. Application: decoding BCH codes; Part II. Newton: 8. Fast multiplication; 9. Newton iteration; 10. Fast polynomial evaluation and interpolation; 11. Fast Euclidean Algorithm; 12. Fast linear algebra; 13. Fourier Transform and image compression; Part III. Gauß: 14. Factoring polynomials over finite fields; 15. Hensel lifting and factoring polynomials; 16. Short vectors in lattices; 17. Applications of basis reduction; Part IV. Fermat: 18. Primality testing; 19. Factoring integers; 20. Application: public key cryptography; Part V. Hilbert: 21. Gröbner bases; 22. Symbolic integration; 23. Symbolic summation; 24. Applications; Appendix: 25. Fundamental concepts; Sources of illustrations; Sources of quotations; List of algorithms; List of figures and tables; References; List of notation; Index.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)