Skip to content

Combinatorics: Topics, Techniques, Algorithms
Stock Photo: Cover May Be Different

Combinatorics: Topics, Techniques, Algorithms Paperback - 1995

by Cameron, Peter J

  • Used
  • Paperback

Description

Cambridge University Press, 1995. 355 pp., paperback, bottom corner lightly rubbed, else fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
NZ$29.11
NZ$7.48 Shipping to USA
Standard delivery: 7 to 14 days
More Shipping Options
Ships from Zubal Books (Ohio, United States)

Details

  • Title Combinatorics: Topics, Techniques, Algorithms
  • Author Cameron, Peter J
  • Binding Paperback
  • Edition US soft cover ed
  • Pages 368
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press, Cambridge
  • Date 1995
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # ZB1289892
  • ISBN 9780521457613 / 0521457610
  • Weight 1.35 lbs (0.61 kg)
  • Dimensions 9.2 x 7.5 x 1 in (23.37 x 19.05 x 2.54 cm)
  • Library of Congress subjects Combinatorial analysis
  • Library of Congress Catalog Number 94004680
  • Dewey Decimal Code 511.6

About Zubal Books Ohio, United States

Biblio member since 2005
Seller rating: This seller has earned a 5 of 5 Stars rating from Biblio customers.

Zubal Books has been the leader in scholarly and rare books since 1961. We purchase individual books as well as entire libraries.

Terms of Sale: All prices are NET. Returns accepted within 5 days of receiving book.

Browse books from Zubal Books

First line

Combinatorics is special.

From the rear 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.