Combinatorics: Topics, Techniques, Algorithms

Front Cover
Cambridge University Press, Oct 6, 1994 - Mathematics - 355 pages
0 Reviews
Combinatorics is a subject of increasing importance because of its links with computer science, statistics, and algebra. This textbook stresses common techniques (such as generating functions and recursive construction) that underlie the great variety of subject matter, and the fact that a constructive or algorithmic proof is more valuable than an existence proof. The author emphasizes techniques as well as topics and includes many algorithms described in simple terms. The text should provide essential background for students in all parts of discrete mathematics.

What people are saying - Write a review

We haven't found any reviews in the usual places.

Other editions - View all

References to this book

All Book Search results »

Bibliographic information