BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Combinatorics: Topics, Techniques, Algorithms

Combinatorics: Topics, Techniques, Algorithms

Combinatorics: Topics, Techniques, Algorithms
Stock photo: cover may vary

Combinatorics: Topics, Techniques, Algorithms Paperback - 1994

by Cameron, Peter J

Add to wish list
  • Used
  • very good
  • first
Used - Very good

Description

Cambridge University Press. 1. Very Good. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.
Ask the seller a question Add to wish list
A$33.63
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Ships from BooksRun (Pennsylvania, United States)

Details

  • Title Combinatorics: Topics, Techniques, Algorithms
  • Author Cameron, Peter J
  • Binding Paperback
  • Edition 1
  • Condition Used - Very good
  • Pages 368
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press, Cambridge
  • Publication date 1994-10-06
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # 0521457610-11-1
  • 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)
  • Category Mathematics
  • Library of Congress subjects Combinatorial analysis
  • Library of Congress Catalogue Number 94004680
  • Dewey Decimal Code 511.6
  • Quantity available 1

About BooksRun Pennsylvania, United States

Specialising in: Textbooks
Biblio member since 2016

BooksRun - best place to buy, sell or rent cheap textbooks

Terms of Sale:

30 days return guarantee. 10% restocking fee applies to discretionary returns

Browse books from BooksRun

Reader reviews for Combinatorics: Topics, Techniques, Algorithms

From the publisher

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.

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.
tracking-