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

**Notes on Combinatorics**

by

**Peter J. Cameron**-

**Queen Mary, University of London**

Contents: Subsets and binomial coefficients; Selections and arrangements; Power series; Recurrence relations; Partitions and permutations; The Principle of Inclusion and Exclusion; Families of sets; Systems of distinct representatives; etc.

(

**9184**views)

**Combinatorics Through Guided Discovery**

by

**Kenneth P. Bogart**-

**Dartmouth College**

This is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as 'counting'. The book consists almost entirely of problems.

(

**9327**views)

**New Perspectives in Algebraic Combinatorics**

by

**Louis J. Billera, at al.**-

**Cambridge University Press**

The rich combinatorial problems arising from the study of various algebraic structures are the subject of the book. It will present the state of the art to graduate students and researchers in combinatorics as well as algebra, geometry, and topology.

(

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

(

**11264**views)