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