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.

Скачать книгу бесплатно (pdf, 9.35 Mb)

---

Читать «Handbook of discrete and combinatorial mathematics»