Discrete algorithmic mathematics
著者
書誌事項
Discrete algorithmic mathematics
A K Peters, c2004
3rd ed
大学図書館所蔵 件 / 全10件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Bibliography: p. 723-727
Includes index
内容説明・目次
内容説明
Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology. Written in a lively, clear style that talks to the reader, the book is unique for its emphasis on algorithmics and the inductive and recursive paradigms as central mathematical themes. It includes a broad variety of applications, not just to mathematics and computer science, but to natural and social science as well.
A manual of selected solutions is available for sale to students; see sidebar. A complete solution manual is available free to instructors who have adopted the book as a required text.
目次
PROLOGUE What Is Discrete Algorithmic Mathematics? CHAPTER 0 Mathematical Preliminaries CHAPTER 1 AlgorithmsCHAPTER 2 Mathematical Induction CHAPTER 3 Graphs and Trees CHAPTER 4 Fundamental Counting Methods CHAPTER 5 Difference Equations CHAPTER 6 Probability CHAPTER 7 An Introduction to Mathematical Logic EPILOGUE Coming Full Circle with Biology and Minimax Theorems
「Nielsen BookData」 より