Mathematica, Maple, and similar software packages provide programs that carry out sophisticated mathematical operations. Applying the ideas introduced in Computer Algebra and Symbolic Computation: Elementary Algorithms, this book explores the application of algorithms to such methods as automatic simplification, polynomial decomposition, and polynomial factorization. This book includes complexity analysis of algorithms and other recent developments. It is well-suited for self-study and can be used as the basis for a graduate course. Maintaining the style set by Elementary Algorithms, the author explains mathematical methods as needed while introducing advanced methods to treat complex operations.

About the Author
Joel S. Cohen

Reviews

" ""There is no doubt that this book is a labour of love. It grew out of the author's lectures on computer algebra . . . and was perfected over the years, as one can see from the careful choice of topics, and the smoothness with which the text flows . . . this is not just a wonderful book to teach from, but one that can be read profitably by any bright undergraduate student."" -S. C. Coutinho, The Mathematical Gazette, July 2004
""A readable introduction to computer algebra . . . useful to undergraduate students of mathematics and computer science. The text is also accessible to a more general audience interested in computer algebra and its applications."" -EMS Newsletter, June 2004"

Book Information
ISBN 9780367659479
Author Joel S. Cohen
Format Paperback
Page Count 466
Imprint CRC Press
Publisher Taylor & Francis Ltd
Weight(grams) 639g