Join Books.org — it's free

Computer Science & Combinatorics
Combinatorics: Topics, Techniques, Algorithms by Peter J. Cameron β€” book cover

Combinatorics: Topics, Techniques, Algorithms

by Peter J. Cameron
Available on Bookshop Write a review

Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.

Log in to track your reading progress.

Overview

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.

Synopsis

A textbook in combinatorics for second-year undergraduate to beginning graduate students.

Reviews

There are no reviews yet. Log in to write one.

Book Details

Published
October 1, 1994
Publisher
Cambridge University Press
Pages
368
Format
Paperback
ISBN
9780521457613

More by Peter J. Cameron

Similar books