Skip to content
Register Sign in Wishlist

Modern Computer Algebra

3rd Edition

$133.00 (C)

  • Date Published: June 2013
  • availability: Available
  • format: Hardback
  • isbn: 9781107039032

$ 133.00 (C)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    • Detailed algorithms with analysis, and complete proofs (none left to the reader)
    • Student-friendly with gentle introductions and overviews
    • Includes many illustrations and applications and much historical background
    • Solutions to selected exercises are available from the book's webpage
    Read more

    Reviews & endorsements

    "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

    "… a polished introduction to algorithms for performing algebraic operations on a computer … The book is almost as interesting for the advanced mathematics (mostly in ring and ideal theory and in linear algebra) that is needed to develop the algorithms. It assumes familiarity with the fundamentals of these topics, but does include a 25-page appendix summarizing the needed background. It is well-equipped with exercises, ranging from numerical practice to extensions and variants on results in the body."
    Allen Stenger, MAA Reviews

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Edition: 3rd Edition
    • Date Published: June 2013
    • format: Hardback
    • isbn: 9781107039032
    • length: 808 pages
    • dimensions: 249 x 183 x 41 mm
    • weight: 1.77kg
    • contains: 55 b/w illus. 53 colour illus. 40 tables 560 exercises
    • availability: Available
  • Table of Contents

    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
    25. Fundamental concepts
    Sources of illustrations
    Sources of quotations
    List of algorithms
    List of figures and tables
    List of notation

  • Resources for

    Modern Computer Algebra

    Joachim von zur Gathen, Jürgen Gerhard

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact

  • Authors

    Joachim von zur Gathen, Bonn-Aachen International Center for Information Technology
    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, Maplesoft, Canada
    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.

Related Books

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.