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

**Discrepancy Theory**

by

**William Chen**-

**Macquarie University**

Contents: Uniform Distribution; Classical Discrepancy Problem; Generalization of the Problem; Introduction to Lower Bounds; Introduction to Upper Bounds; Fourier Transform Techniques; Upper Bounds in the Classical Problem; Disc Segment Problem; etc.

(

**3574**views)

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

(

**10338**views)

**An Introduction to Combinatorics and Graph Theory**

by

**David Guichard**-

**Whitman College**

The book covers the classic parts of Combinatorics and graph theory, with some recent progress in the area. Contents: Fundamentals; Inclusion-Exclusion; Generating Functions; Systems of Distinct Representatives; Graph Theory; Polya-Redfield Counting.

(

**1041**views)

**Combinatorial Theory**

by

**Gian-Carlo Rota**

In 1998, Gian-Carlo Rota gave his famous course at MIT. John N. Guidi took notes in a verbatim manner conveying the substance of the course. Topics covered included sets, relations, enumeration, order, matching, matroids, and geometric probability.

(

**1004**views)