Polynomial Algorithms in Computer Algebra

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.

שנה

1996

שפה

English

סדרה

Texts and Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes-Kepl

הוצאה

Springer Vienna

מהדורות

3

עמודים

270

ISBN

9783709165713

מקור הנתונים: Wikidata