Logo

Combinatorial Algorithms by Albert Nijenhuis, Herbert S. Wilf

Large book cover: Combinatorial Algorithms

Combinatorial Algorithms
by

Publisher: Academic Press Inc
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.

Home page url

Download or read it online for free here:
Download link
(5.5MB, PDF)

Similar books

Book cover: Combinatorial TheoryCombinatorial Theory
by
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.
(2515 views)
Book cover: Notes on CombinatoricsNotes on Combinatorics
by - 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.
(5609 views)
Book cover: Analytic CombinatoricsAnalytic Combinatorics
by - Cambridge University Press
Deals with the the analysis of discrete structures, that emerged over the past years as an essential tool in the understanding of computer programs and models with applications in science. The text contains examples and exercises.
(12426 views)
Book cover: Enumerative Combinatorics: Volume 1Enumerative Combinatorics: Volume 1
by - MIT
The standard guide to the topic for students and experts alike. The material in Volume 1 was chosen to cover those parts of enumerative combinatorics of greatest applicability and with the most important connections with other areas of mathematics.
(2881 views)