Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your email address or mobile phone number.

Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Combinatorics for Computer Science (Dover Books on Mathematics) Paperback – May 8, 2002

5 out of 5 stars 2 customer reviews

See all 2 formats and editions Hide other formats and editions
Price
New from Used from
Paperback
"Please retry"
$45.95 $5.10
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Top 20 lists in Books
Top 20 lists in Books
View the top 20 best sellers of all time, the most reviewed books of all time and some of our editors' favorite picks. Learn more
NO_CONTENT_IN_FEATURE


Product Details

  • Series: Dover Books on Mathematics
  • Paperback: 523 pages
  • Publisher: Dover Publications (May 8, 2002)
  • Language: English
  • ISBN-10: 0486420760
  • ISBN-13: 978-0486420769
  • Product Dimensions: 8.5 x 5.4 x 1 inches
  • Shipping Weight: 1.2 pounds
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Best Sellers Rank: #2,164,582 in Books (See Top 100 in Books)

More About the Authors

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

5 star
100%
4 star
0%
3 star
0%
2 star
0%
1 star
0%
See both customer reviews
Share your thoughts with other customers

Top Customer Reviews

Format: Paperback Verified Purchase
I am a software engineer by trade, and this is the book I wish I had with me.

Today, I don't see it as a textbook for coursework, but I think there are probably better in today's world. Though I will let the other reviewer's viewpoint on this address that issue.

However, this is an excellent book for any programmer or software engineer. Honestly I doubt most programmers have this math background ( okay contradicting myself a little, but I did say the other reviewer covered the academic side of this ).

The structure of this books makes it an excellent self-study or reference for actually coding. You will have to brush up on the notation at the beginning of the book, but that is minor.

It is well written and has very broad coverage of the subject and does not lose rigor or examples. It is well illustrated when it needs to be. Whether you are writing sorting routines or want to really understand and implement graph theory. ( the graph theory coverage is outstanding. ). Honestly you could spend a month learning everything you wanted to know about sorting and network optization from this book.

It is not an easy textbook, and honestly I have alot to learn from it yet, but I just simply have to revisit some of my math foundations. But even if you get lost on part of the material in the book, it is still worth it for what you will get.

The only cons are some of the material not covered in this book from number theory, which newer textbooks really cover well.
Comment 2 of 2 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
This excellent reference has numerous examples, definitions and exercises covering trees, graphs, linked lists etc. This book provides a great companion to any data structures text.
1 Comment 4 of 11 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Want to discover more products? Check out this page to see more: discrete math