**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

**Design and Analysis of Computer Algorithms**

by

**David M. Mount**-

**University of Maryland**

The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.

(

**18758**views)

**Elementary Algorithms**

by

**Larry LIU Xinyu**-

**Github**

'Elementary Algorithms' is a free book about elementary algorithms and data structures. This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures.

(

**9551**views)

**Data Structures and Algorithm Analysis in Java**

by

**Clifford A. Shaffer**-

**Dover Publications**

A comprehensive treatment focusing on the creation of efficient data structures and algorithms, explaining how to select the data structure best suited to specific problems. It uses Java programming language and is suitable for second-year courses.

(

**20405**views)

**Knapsack Problems: Algorithms and Computer Implementations**

by

**Silvano Martello, Paolo Toth**-

**John Wiley & Sons**

The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.

(

**18319**views)