Item description for Polynomial Algorithms in Computer Algebra (Texts and Monographs in Symbolic Computation) by Franz Winkler...
The book gives a thorough introduction to the mathematical underpinnings of computer algebra. The subjects treated range from arithmetic of integers and polynomials to fast factorization methods, GrAbner bases, and algorithms in algebraic geometry. The algebraic background for all the algorithms presented in the book is fully described, and most of the algorithms are investigated with respect to their computational complexity. Each chapter closes with a brief survey of the related literature.The book is designed as a textbook for a course in computer algebra for advanced undergraduate or beginning graduate students. Every chapter contains a considerable number of exercises, some of which are solved in the appendix. In bridging the gap between the algebraic theory and computer algebra software, the book should be of interest to both mathematics and computer science students.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 0.5" Width: 6.5" Height: 9.75" Weight: 1.2 lbs.
Release Date Aug 2, 1996
ISBN 3211827595 ISBN13 9783211827598
Availability 0 units.
More About Franz Winkler
Franz Winkler was born in 1955 and has an academic affiliation as follows - Johannes Kepler Universit??t Linz Johannes Kepler Universitat Linz Joh.
Reviews - What do customers think about Polynomial Algorithms in Computer Algebra (Texts and Monographs in Symbolic Computation)?
Not a book for the weak of (algebraic) heart Aug 26, 2000
Winkler presents an extremely concise overview of the major algorithms of polynomial algebra. In order to understand the text fully you must have a very strong background in abstract algebra. Even then you'll probably find yourself re-reading sections of the book in an attempt to reach an understanding. The advantage of this book over more explanatory texts (like Geddes) comes from the meticulous quality of the proofs and algorithms.