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
An Introduction to Combinatorics and Graph Theoryby 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.
(8529 views)
Algebraic and Geometric Methods in Enumerative Combinatoricsby Federico Ardila - arXiv
The main goal of this survey is to state clearly and concisely some of the most useful tools in algebraic and geometric enumeration, and to give many examples that quickly and concretely illustrate how to put these tools to use.
(7979 views)
Counting Rocks! An Introduction to Combinatoricsby Henry Adams, et al. - arXiv.org
This textbook is an interactive introduction to combinatorics at the undergraduate level. The major topics in this text are counting problems, proof techniques, recurrence relations and generating functions, and an introduction to graph theory.
(3733 views)
Notes on the Combinatorial Fundamentals of Algebraby Darij Grinberg - arXiv.org
This is a detailed survey, with rigorous and self-contained proofs, of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants.
(3363 views)