by Bhubaneswar Mishra
Publisher: Courant Institute of Mathematical Sciences 1993
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:
by Leonard Soicher, Franco Vivaldi - 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.
by R. L. Constable, at al. - Prentice Hall
The authors offer a tutorial on the new mathematical ideas which underlie their research. Many of the ideas in this book will be accessible to a well-trained undergraduate with a good background in mathematics and computer science.
by Thomas Hales - 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.
by Julien C. Sprott - M & T Books
Chaos and fractals have revolutionized our view of the world. This book shows examples of the artistic beauty that can arise from very simple equations, and teaches the reader how to produce an endless variety of such patterns.