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.
Discrete Algorithmic Mathematics, Third Edition
โ Scribed by Maurer, Stephen B.; Ralston, Anthony
- Publisher
- CRC Press;A.K.Peters, CRC
- Year
- 2005
- Tongue
- English
- Leaves
- 779
- Series
- EBL Schweitzer
- Edition
- 3rd ed (Online-Ausg.)
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Front Cover; List of Algorithms; Contents; Instructor's Preface; Student's Preface; Chapter Summaries; Pathways Through the Book; Problem Difficulty Rating; Symbols, Notation, Abbreviations and Conventions; Prologue: What is Discrete Algorithmic Mathematics?; CHAPTER 0: Mathematical Preliminaries ; CHAPTER 1: Algorithms ; CHAPTER 2: Mathematical Induction ; CHAPTER 3: Graphs and Trees ; CHAPTER 4: Fundamental Read more...
Abstract: Front Cover; List of Algorithms; Contents; Instructor's Preface; Student's Preface; Chapter Summaries; Pathways Through the Book; Problem Difficulty Rating; Symbols, Notation, Abbreviations and Conventions; Prologue: What is Discrete Algorithmic Mathematics?; CHAPTER 0: Mathematical Preliminaries ; CHAPTER 1: Algorithms ; CHAPTER 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 Final Problems; References; Appendix: Limits; Hints and Answers; About the Authors
๐ SIMILAR VOLUMES
This third edition offers an introduction to discrete mathematics, covering relations, induction, counting techniques, logic and graphs. More advanced topics of Boolean algebra and permutation groups are included, and there are numerous examples to reinforce the material.
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.
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.