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 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 Philip J. Koopman, Jr. - Academic Press
The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that compare favorably with previously reported techniques.
by Cameron Davidson-Pilon - GitHub, Inc.
This book is designed as an introduction to Bayesian inference from a computational understanding-first, and mathematics-second, point of view. The book assumes no prior knowledge of Bayesian inference nor probabilistic programming.
The aim of this text is to develop an informal, light introduction to the world of fractal geometry and to inspire further research into the subject, whether your interest is of a pure, applied or even recreational nature.