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.
(9879 views)
Analytic Combinatoricsby Philippe Flajolet, Robert Sedgewick - 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.
(19205 views)
Combinatory Analysisby 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 ...
(8827 views)
Combinatorics Through Guided Discoveryby 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.
(11497 views)