or
Sign in to turn on 1-Click ordering.
 
 
Express Checkout with PayPhrase
What's this? | Create PayPhrase
Sorry!
More Buying Choices
18 used & new from $79.00

Have one to sell? Sell yours here
 
   
Handbook of Discrete and Combinatorial Mathematics, Second Edition
 
 
Tell the Publisher!
I’d like to read this book on Kindle

Don’t have a Kindle? Get your Kindle here.
 
  

Handbook of Discrete and Combinatorial Mathematics, Second Edition (Hardcover)

~ (Editor) "This chapter covers material usually referred to as the foundations of mathematics, including logic, sets, and functions..." (more)
Key Phrases: hyperline sequences, minimum realizer, projective line arrangement, Monte Carlo, Academic Press, Las Vegas (more...)
5.0 out of 5 stars  See all reviews (2 customer reviews)

List Price: $129.95
Price: $87.71 & this item ships for FREE with Super Saver Shipping. Details
You Save: $42.24 (33%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.

Only 2 left in stock--order soon (more on the way).

Want it delivered Monday, November 16? Choose One-Day Shipping at checkout. Details
7 new from $79.00 11 used from $87.70
There is a newer edition of this item:
Handbook of Discrete and Combinatorial Mathematics, Second Edition (Discrete Mathematics and Its Applications) Handbook of Discrete and Combinatorial Mathematics, Second Edition (Discrete Mathematics and Its Applications)
$127.00
Available for Pre-order
What Do Customers Ultimately Buy After Viewing This Item?

Frequently Bought Together

Customers buy this book with Handbook of Graph Theory (Discrete Mathematics and Its Applications) by Jonathan L. Gross

Handbook of Discrete and Combinatorial Mathematics, Second Edition + Handbook of Graph Theory (Discrete Mathematics and Its Applications)
Price For Both: $208.71

Show availability and shipping details


Customers Who Bought This Item Also Bought

Discrete and Combinatorial Mathematics: An Applied Introduction, Fifth Edition

Discrete and Combinatorial Mathematics: An Applied Introduction, Fifth Edition

by Ralph P. Grimaldi
3.5 out of 5 stars (28)  $101.74
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

by Charles J. Colbourn
5.0 out of 5 stars (1)  $129.95
Introductory Graph Theory

Introductory Graph Theory

by Gary Chartrand
4.8 out of 5 stars (10)  $10.17
Randomized Algorithms

Randomized Algorithms

by Prabhakar Raghavan
4.0 out of 5 stars (7)  $61.60
Handbook of Discrete and Computational Geometry, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Discrete and Computational Geometry, Second Edition (Discrete Mathematics and Its Applications)

by Jacob E. Goodman
4.0 out of 5 stars (1)  $118.96
Explore similar items

Editorial Reviews

Review

I like the book's format. There are glossaries at the beginning of each chapter. Each subsection begins with definitions and goes on to facts, then algorithms (boxed and in pseudo -code), lists of mathematical objects, illuminating pictures, examples, lists of applications, and, finally, bibliography and web sources. This handbook will appeal both to pure and to applied mathematicians. Its 17 chapters, and 115 subsections were produced by 77 individuals, kept nicely in line (no mean task) by five editors who, in turn, got the go-ahead signal and the prestige of an advisory editorial board of 23 distinguished authorities.
--SIAM News -June 2001

I like the books format. There are glossaries at the beginning of each chapter. Each subsection begins with definitions and goes on to facts, then algorithms (boxed and in pseudo -code), lists of mathematical objects, illuminating pictures, examples, lists of applications, and, finally, bibliography and web sources. This handbook will appeal both to pure and to applied mathematicians. Its 17 chapters, and 115 subsections were produced by 77 individuals, kept nicely in line (no mean task) by five editors who, in turn, got the go-ahead signal and the prestige of an advisory editorial board of 23 distinguished authorities.
--SIAM News -June 2001

No other book covers such a wide range of topics in discrete mathematics…a useful resource.
--CHOICE Magazine

No other book covers such a wide range of topics in discrete mathematics…a useful resource.
--CHOICE Magazine

intended to provide a user a quick and concise look up facility for definitions, basic facts, algorithms, standard examples, tables, printed references and URLs for the various objects of discrete mathematics. Thus it will be a valuable supplement in any library.
-Monatshefte fur Mathematics, Volume 134, No. 3, 2002

…a valuable reference tool for professionals and students using discrete mathematics…The coverage is vast…This book is a must-buy for research libraries.
--Journal of Mathematical Psychology, February 2002

…a valuable reference tool for professionals and students using discrete mathematics…The coverage is vast…This book is a must-buy for research libraries.
--Journal of Mathematical Psychology, February 2002


Product Description

The importance of discrete mathematics has increased dramatically within the last few years but until now, it has been difficult-if not impossible-to find a single reference book that effectively covers the subject. To fill that void, The Handbook of Discrete and Combinatorial Mathematics presents a comprehensive collection of ready reference material for all of the important areas of discrete mathematics, including those essential to its applications in computer science and engineering. Its topics include:oLogic and foundationsoCountingoNumber theoryoAbstract and linear algebraoProbabilityoGraph theoryoNetworks and optimizationoCryptography and codingoCombinatorial designsThe author presents the material in a simple, uniform way, and emphasizes what is useful and practical. For easy reference, he incorporates into the text:oMany glossaries of important termsoLists of important theorems and formulasoNumerous examples that illustrate terms and conceptsoHelpful descriptions of algorithmsoSummary tablesoCitations of Web pages that supplement the textIf you have ever had to find information from discrete mathematics in your work-or just out of curiosity-you probably had to search through a variety of books to find it. Never again. The Handbook of Discrete Mathematics is now available and has virtually everything you need-everything important to both theory and practice.

Product Details

  • Hardcover: 1232 pages
  • Publisher: CRC; 1 edition (September 28, 1999)
  • Language: English
  • ISBN-10: 0849301491
  • ISBN-13: 978-0849301490
  • Product Dimensions: 10.3 x 7.1 x 2.5 inches
  • Shipping Weight: 5 pounds (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon.com Sales Rank: #361,100 in Books (See Bestsellers in Books)

    Popular in these categories: (What's this?)

    #60 in  Books > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Combinatorics
    #79 in  Books > Science > Mathematics > Pure Mathematics > Combinatorics

More About the Author

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

Visit Amazon's Kenneth H. Rosen Page

Inside This Book (learn more)
First Sentence:
This chapter covers material usually referred to as the foundations of mathematics, including logic, sets, and functions. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
hyperline sequences, minimum realizer, projective line arrangement, successive shortest path algorithm, dynamic graph algorithms, complementary slackness optimality conditions, nonbipartite networks, nontaking rooks, principal subtree, path optimality conditions, strict digraph, triangular chord, crosscap number, traverses the entire set, symmetric chain decomposition, banded problems, linked adjacency list, multivariate composition, next sublist, normalized drawing, subgraph collection, concentrator location problem, greedy coloring algorithm, pseudoline arrangement, incomparability graph
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Monte Carlo, Academic Press, Las Vegas, Cambridge University Press, Printed Resources, Lecture Notes, Web Resources, Oxford University Press, Burnside's Lemma, Axiom of Assignment, Discrete Comput, Management Science, Game of Life, Theory of Computing, Tower of Hanoi, American Mathematical Society, Carl Pomerance, The Stony Brook Algorithm Repository, Axiom of Sequence, Prentice Hall, Brook Workshop, Clarendon Press, Electronic Proceedings of the Fifth, The Art of Computer Programming, Theory of Numbers
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:




Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

 

Customer Reviews

2 Reviews
5 star:
 (2)
4 star:    (0)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
5.0 out of 5 stars (2 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

 
7 of 7 people found the following review helpful:
5.0 out of 5 stars Excellent, April 16, 2004
At the university I am attending Johnsonbaugh's book was a required text for a subject introducing discrete mathematics. Unfortunately, like many others it seems, I was less than impressed with the books ability 'teach', or even reinforce what we had just studied in lectures. I went looking for another book, not so much as a replacement for Johnsonbaugh's book, but as an additional reference/study aid.

Since owning this book I've found myself turning to it for explanations and examples over the required text. Almost every section lists definitions of terms, a bunch of useful facts and fully worked examples. Explanations and examples are clear and concise, while the facts often help to understand the process involved before getting into the examples.

I'd like to stress that this is certainly no replacement for a text book in discrete/combinatorial mathematics, however it is marvelous to have by your side to provide additional help through problem areas.

Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)



 
7 of 9 people found the following review helpful:
5.0 out of 5 stars Amazingly comprehensive, January 6, 2000
By A Customer
This book will occupy a prime spot on my bookshelf. I've had to use a bunch of different books to find this kind of information before. It's nice to see such a wide range of topics from discrete math covered so thoroughly.
Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)


Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   




Product Information from the Amapedia Community

Beta (What's this?)


Look for Similar Items by Category


Look for Similar Items by Subject

 

Feedback

If you need help or have a question for Customer Service, contact us.
 Would you like to update product info or give feedback on images?
Is there any other feedback you would like to provide?

Your comments can help make our site better for everyone.


Your Recent History

 (What's this?)

After viewing product detail pages or search results, look here to find an easy way to navigate back to pages you are interested in.