Handbook Of Discrete And Combinatorial Mathematics - Couverture rigide

Rosen, Kenneth-H; Michaels, John-G; Gross, Jonathan-L; Grossman, Jerrold-W; Shier, Douglas-R

 
9780849301490: Handbook Of Discrete And Combinatorial Mathematics

Synopsis

The importance of discrete mathematics has increased dramatically within the last few years, but until now it bas 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 : logic and foundations ; counting ; number theory ; abstract and linear algebra ; discrete probability ; graph theory ; networks and optimization ; cryptography and coding ; combinatorial designs ; computational geometry ; theoretical computer science. The handbook presents material in a simple, uniform way, and emphasizes what is useful and practical. Key elements of the text include : extensive glossaries of important terms ; lists of important theorems and formulas ; numerous examples that illustrate terms and concepts ; helpful descriptions of algorithms ; summary tables ; links to Web pages and pointers to printed resources. If you have ever had to find information from discrete mathematics in your work - or were just curious about one of its topics - you probably had to search through a variety of books to find it. Never again. Whether you're an engineer, computer professional, student, or someone interested in math, you will find this book incredibly useful. The " Handbook of Discrete and Combinatorial Mathematics " has virtually everything you need in a single volume.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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:

  • Logic and foundations
  • Counting
  • Number theory
  • Abstract and linear algebra
  • Probability
  • Graph theory
  • Networks and optimization
  • Cryptography and coding
  • Combinatorial designs
    The author presents the material in a simple, uniform way, and emphasizes what is useful and practical. For easy reference, he incorporates into the text:
  • Many glossaries of important terms
  • Lists of important theorems and formulas
  • Numerous examples that illustrate terms and concepts
  • Helpful descriptions of algorithms
  • Summary tables
  • Citations of Web pages that supplement the text
    If 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.
  • Présentation de l'éditeur

    The importance of discrete and combinatorial mathematics continues to increase as the range of applications to computer science, electrical engineering, and the biological sciences grows dramatically. Providing a ready reference for practitioners in the field, the Handbook of Discrete and Combinatorial Mathematics, Second Edition presents additional material on Google's matrix, random graphs, geometric graphs, computational topology, and other key topics. New chapters highlight essential background information on bioinformatics and computational geometry. Each chapter includes a glossary, definitions, facts, examples, algorithms, major applications, and references.

    Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.