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.
Back Cover Copy
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. From the fundamentals of logic, counting, and number theory to a myriad of applications, the author presents the material in a simple, uniform way that emphasizes each topic's practical aspects. For easy reference, the text incorporates glossaries of important terms, lists of important theorems and formulas, numerous examples, Web site citations, and summary tables.
The Handbook of Discrete and Combinatorial Mathematics is the first book presenting a comprehensive collection of reference material for the essential areas of discrete mathematics as well as for important applications to computer science and engineering. Topics include logic and foundations, counting, number theory, abstract and linear algebra, probability, graph theory, networks and optimization, cryptography and coding, and combinatorial designs.
Review
No other book covers such a wide range of topics in discrete mathematicsa useful resource.
--CHOICE Magazine
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
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 mathematicsThe coverage is vastThis book is a must-buy for research libraries.
--Journal of Mathematical Psychology, February 2002
PassWord: www.freebookspot.com
|
Comments (0)
All
