Book Description
Computer algebra, or algorithmic algebra, studies these algorithms and their properties and represents a rich intersection of theoretical computer science with classical mathematics.
This book provides a systematic and focused treatment of a collection of core problems the computational equals to the classical Fundamental Problem of Algebra and its derivatives. Topics covered include the GCD, sub resultants, modular techniques, the fundamental theorem of algebra, roots of polynomials, Sturm theory, Gaussian lattice reduction, lattices and polynomial factorization, linear systems, elimination theory, Grobner bases, and more.