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: 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.
(9184 views)
Book cover: Combinatorics Through Guided DiscoveryCombinatorics Through Guided Discovery
by - 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)
Book cover: New Perspectives in Algebraic CombinatoricsNew Perspectives in Algebraic Combinatorics
by - 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)
Book cover: Foundations of Combinatorics with ApplicationsFoundations of Combinatorics with Applications
by - 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)