Algorithmic Algebra by Bhubaneswar Mishra

Large book cover: Algorithmic Algebra

Algorithmic Algebra

Publisher: Courant Institute of Mathematical Sciences
ISBN/ASIN: 0387940901
ISBN-13: 9780387940908
Number of pages: 425

Algorithmic Algebra studies some of the main algorithmic tools of computer algebra, covering such topics as Gröbner bases, characteristic sets, resultants and semialgebraic sets. The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra or understand the algorithms underlying many popular symbolic computational systems.

Home page url

Download or read it online for free here:
Download link
(2.3MB, PDF)

Similar books

Book cover: Think Stats: Probability and Statistics for ProgrammersThink Stats: Probability and Statistics for Programmers
by - Green Tea Press
Think Stats is an introduction to Probability and Statistics for Python programmers. This new book emphasizes simple techniques you can use to explore real data sets and answer interesting statistical questions. Basic skills in Python are assumed.
Book cover: Mathematics in the Age of the Turing MachineMathematics in the Age of the Turing Machine
by - arXiv
Computers have rapidly become so pervasive in mathematics that future generations may look back to this day as a golden dawn. The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.
Book cover: Curves and Surfaces in Geometric Modeling: Theory and AlgorithmsCurves and Surfaces in Geometric Modeling: Theory and Algorithms
by - Morgan Kaufmann
This book offers both a theoretically unifying understanding of polynomial curves and surfaces and an effective approach to implementation that you can bring to bear on your own work -- whether you are a graduate student, scientist, or practitioner.
Book cover: Algorithmic MathematicsAlgorithmic Mathematics
by - Queen Mary University of London
This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.