|
New: $125.10
Pub. price: $139.00
Paperback
09B9
|
Polynomial Algorithms in Computer Algebra
ISBN: 3211827595
Publisher: Springer Verlag Published: Jun 1 1996 Pages: 270 Weight: 1.20lbs. Height: 9.75" Width: 6.50" Depth: 0.50" Language: English
Publisher's Comments
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, Gröbner bases, and algorithms in algebraic geometry. The algebraic background for all the algorithms pr...
Continued below >>>
|
 |
Publisher's Comments (cont.)
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, Gröbner 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.
|
|
|
| Notify me of updates to Polynomial Algorithms in Computer Algebra |
|
|
|
|
Magers & Quinn Booksellers - 3038 Hennepin Ave. South, Minneapolis, MN 55408 - 612-822-4611