**A=B**

by Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger

**Publisher**: AK Peters, Ltd. 1996**ISBN/ASIN**: 1568810636**ISBN-13**: 9781568810638**Number of pages**: 217

**Description**:

This book introduces the idea of hypergeometric function, the Swiss army knife of combinatorial mathematics, and proceeds to develop algorithms for their computation as well as numerous applications. The authors also reveal what, exactly, computers can help us to decide, what is a "closed form" solution, what are "canonical" and "normal" forms, and inject relevant philosophical digressions that keep the discussions lively and entertaining. The authors also present snippets of "Mathematica" code so that you can try out many of the basic operations yourself.

Download or read it online for free here:

**Download link**

(1.2MB, PDF)

## Similar books

**Algorithms for Clustering Data**

by

**Anil K. Jain, Richard C. Dubes**-

**Prentice Hall**

The book is useful for scientists who gather data and seek tools for analyzing and interpreting data. It will be a reference for scientists in a variety of disciplines and can serve as a textbook for a graduate course in exploratory data analysis.

(

**20731**views)

**Problems on Algorithms, 2nd edition**

by

**Ian Parberry, William Gasarch**-

**Prentice Hall**

A collection of problems on the design, analysis, and verification of algorithms for practicing programmers who wish to hone and expand their skills, as a supplementary text for students, and as a self-study text for graduate students.

(

**18843**views)

**Vector Models for Data-Parallel Computing**

by

**Guy Blelloch**-

**The MIT Press**

Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.

(

**12205**views)

**Search Algorithms and Applications**

by

**Nashat Mansour**-

**InTech**

This book demonstrates the applicability of search algorithms for the purpose of developing solutions to problems that arise in a variety of domains. It is targeted to a wide group of readers: researchers, graduate students, and practitioners.

(

**15700**views)