Discrete mathematics for computer scientists
Author(s)
Bibliographic Information
Discrete mathematics for computer scientists
Addison-Wesley, c1999
2nd ed
Available at / 22 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 571-572) and index
Description and Table of Contents
Description
This is a new edition of a successful introduction to discrete mathematics for computer scientists, updated and reorganised to be more appropriate for the modern day undergraduate audience. Discrete mathematics forms the theoretical basis for computer science and this text combines a rigorous approach to mathematical concepts with strong motivation of these techniques via practical examples.
Table of Contents
Preface
List of Symbols
The Natural Numbers
Introductory Logic
Sets, Relations and Functions
Algebraic Topics
Combinatorics
Partially Ordered Structures
Further Logic
Graphs
Formal Machines
Analysis of Algorithms and Complexity Theory
Coding Theory
Answers to selected exercises
Bibliography
Index
by "Nielsen BookData"