Download WordPress Themes, Happy Birthday Wishes
Home » Mathematics » Fundamental Problems of Algorithmic Algebra

Fundamental Problems of Algorithmic Algebra

  • Category: Mathematics
  • Author: Chee-Keng Yap
  • Pages: 528 pages
  • File type: PDF, 546 pages, 5.1 MB

Read and download free eBook intituled Fundamental Problems of Algorithmic Algebra in format PDF, 546 pages, 5.1 MB – 528 pages created by Chee-Keng Yap.

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.

Chee Keng Yap is a professor of Computer Science at New York University. .

Read and Download Links:

Fundamental Problems of Algorithmic Algebra

READ  Introduction to Abstract Algebra by Alexander Paulin

Leave a Reply

Your email address will not be published. Required fields are marked *

*

x

Check Also

Abstract Algebra in GAP

Read and download free Book intituled Abstract Algebra in GAP by Alexander Hulpke in format PDF written by Alexander Hulpke.