Combinatorics: Topics, Techniques, Algorithms

Cameron, Peter J.

ISBN 10: 0521457610 / ISBN 13: 9780521457613

Published by Cambridge University Press, 1995

About this Item

Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Seller Inventory # 000335571U

Bibliographic Details

• Title: Combinatorics: Topics, Techniques, Algorithms
• Publisher: Cambridge University Press
• Publication Date: 1995
• Language: English
• ISBN 10: 0521457610
• ISBN 13: 9780521457613
• Binding: paperback
• Edition: 1st Edition.
• Condition: Good

About this title

Synopsis

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.

From the Back Cover

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.