Skip to content

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

Combinatorics: Topics, Techniques, Algorithms Paperback - 1995

by Cameron, Peter J

  • Used
  • Good
  • Paperback

Description

Cambridge University Press, 1995-01-27. Paperback. Good. Textbook, May Have Highlights, Notes and/or Underlining, BOOK ONLY-NO ACCESS CODE, NO CD, Ships with Emailed Tracking
Used - Good
NZ$97.14
NZ$6.48 Shipping to USA
Standard delivery: 4 to 14 days
More Shipping Options
Ships from SGS Trading Inc (New Jersey, United States)

Details

  • Title Combinatorics: Topics, Techniques, Algorithms
  • Author Cameron, Peter J
  • Binding Paperback
  • Edition US soft cover ed
  • Condition Used - 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 # UJune2019-521457610-1823
  • 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 SGS Trading Inc New Jersey, United States

Specializing in: Reference Books, Textbook
Biblio member since 2009
Seller rating: This seller has earned a 5 of 5 Stars rating from Biblio customers.

Textbook and Reference Books Discounted

Terms of Sale: 30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from SGS Trading Inc

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.