Polynomial Algorithms in Computer Algebra
By: by Franz Winkler
Series: Texts and Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes-Kepler-University, Linz, Austria, 0943-853X; Texts and Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes-Kepler-University, Linz, Austria
Publisher: Springer Vienna; Imprint; Springer
Published: 1996
Place of publication: Vienna
Language: eng
Format: [electronic resource] /
Number of pages: 270
ISBN-13: 9783709165713
Description: 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.