Skip to content

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

Combinatorics: Topics, Techniques, Algorithms Paperback - 1995

by Cameron, Peter J

  • Used

Description

Cambridge University Press. Used - Very Good.
Used - Very Good
NZ$33.28
NZ$24.96 Shipping to USA
Standard delivery: 6 to 12 days
More Shipping Options
Ships from Russell Books Ltd (British Columbia, Canada)

Details

  • Title Combinatorics: Topics, Techniques, Algorithms
  • Author Cameron, Peter J
  • Binding Paperback
  • Edition US soft cover ed
  • Condition Used - Very Good
  • Pages 368
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press, Cambridge
  • Date 1995-01-27
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # FORT787892
  • 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 Russell Books Ltd British Columbia, Canada

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

Family owned and operated since 1961. Located in Downtown Victoria selling new, used, and remainder titles in all categories. We also have an extensive selection of Journals, cards and calendars.

Terms of Sale: For further information - (250) 361-4447 (GST applied to all Canadian orders). Shipping prices are based on books weighing 2.2 LB, or 1 KG. Canadian and U.S. orders sent with Automated Package Tracking and delivery confirmation, where available. If your book order is heavy or over-sized, we may contact you regarding any extra shipping costs.

Browse books from Russell Books Ltd

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.