**Combinatorial Algorithms**

by Albert Nijenhuis, Herbert S. Wilf

**Publisher**: Academic Press Inc 1978**ISBN/ASIN**: 0125192509**ISBN-13**: 9780125192507**Number of pages**: 316

**Description**:

The book is a collection of mathematical algorithms with many new and interesting examples in this second edition. The authors tried to place in the reader's hands a kit of building blocks with which the reader can construct more elaborate structures.

Download or read it online for free here:

**Download link**

(5.5MB, PDF)

## Similar books

**Applied Combinatorics**

by

**S. E. Payne**-

**University of Colorado**

These notes deal with enumerative combinatorics. The author included some traditional material and some truly nontrivial material, albeit with a treatment that makes it accessible to the student. He derives a variety of techniques for counting.

(

**13593**views)

**Foundations of Combinatorics with Applications**

by

**Edward A. Bender, S. Gill Williamson**-

**Dover Publications**

This introduction to combinatorics, the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics. Some ability to construct proofs is assumed.

(

**8747**views)

**Applied Combinatorics**

by

**Mitchel T. Keller, William T. Trotter**-

**Georgia Institute of Technology**

The purpose of the course is to give students a broad exposure to combinatorial mathematics, using applications to emphasize fundamental concepts and techniques. Our approach to the course is to show students the beauty of combinatorics.

(

**6867**views)

**Combinatory Analysis**

by

**Percy A. MacMahon**-

**Cambridge University Press**

The object of this work is to present an account of theorems in combinatory analysis which are of a perfectly general character, and to shew the connexion between them by as far as possible bringing them together as parts of a general doctrine ...

(

**4702**views)