• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Fundamental Problems of Algorithmic Algebra

Fundamental Problems of Algorithmic Algebra

Hardcover

Technology & EngineeringAlgebraGeneral Science

ISBN10: 0195125169
ISBN13: 9780195125160
Publisher: Oxford University Press
Published: Dec 30 1999
Pages: 528
Weight: 2.35
Height: 1.37 Width: 7.86 Depth: 9.57
Language: English
Popular computer algebra systems such as Maple, Macsyma, Mathematica, and REDUCE are now basic tools on most computers. Efficient algorithms for various algebraic operations underlie all these systems. Computer algebra, or algorithmic algebra, studies these algorithms and their properties and represents a rich intersection of theoretical computer science with classical mathematics.

Fundamental Problems of Algorithmic Algebra provides a systematic and focused treatment of a collection of core problemsthe computational equivalents of the classical Fundamental Problem of Algebra and its derivatives. Topics covered include the GCD, subresultants, 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.

Also from

Yap, Chee

Also in

Algebra