- 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)
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.
To get the free app, enter your email address or mobile phone number.
Combinatorics for Computer Science (Dover Books on Mathematics) Paperback – May 8, 2002
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
Customers Who Viewed This Item Also Viewed
More About the AuthorsDiscover books, learn about writers, read author blogs, and more.
Top Customer Reviews
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.