Items related to Combinatorics: Topics, Techniques, Algorithms
Synopsis
Combinatorics is a subject of increasing importance, owing to its links with computer science, statistics and algebra. This is a textbook aimed at second-year undergraduates to beginning graduates. It stresses common techniques (such as generating functions and recursive construction) which underlie the great variety of subject matter and also stresses the fact that a constructive or algorithmic proof is more valuable than an existence proof. The book is divided into two parts, the second at a higher level and with a wider range than the first. Historical notes are included which give a wider perspective on the subject. More advanced topics are given as projects and there are a number of exercises, some with solutions given.
"synopsis" may belong to another edition of this title.
Review
"Cameron covers an impressive amount of material in a relatively small space...an outstanding supplement to other texts..." M. Henle, Choice
"...used as a text at the senior or graduate level and is an excellent reference....The range of topics is very good." The UMAP Journal
Book Description
A textbook in combinatorics for second-year undergraduate to beginning graduate students. The author stresses common techniques (such as generating functions and recursive construction) which underlie the great variety of subject matter. The book is divided into two parts, the second at a higher level and with a wider range than the first. More advanced topics are given as projects, and there are a number of exercises, some with solutions given.
"About this title" may belong to another edition of this title.
- PublisherCambridge University Press
- Publication date1994
- ISBN 10 0521451337
- ISBN 13 9780521451338
- BindingHardcover
- LanguageEnglish
- Number of pages365
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want