Discrete Algorithmic Mathematics
Seiten
2005
|
3rd edition
A K Peters (Verlag)
978-1-56881-166-6 (ISBN)
A K Peters (Verlag)
978-1-56881-166-6 (ISBN)
Thoroughly revised for a one-semester course that allows many options, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. The third edition includes new or extended discussions of order notation, generating functions, computational biology, chaos, and aspects of statistics.
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.
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.
Stephen B Maurer Swarthmore College Anthony Ralston State University of New York at Buffalo
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
| Erscheint lt. Verlag | 21.1.2005 |
|---|---|
| Verlagsort | Natick |
| Sprache | englisch |
| Maße | 191 x 235 mm |
| Gewicht | 1650 g |
| Themenwelt | Mathematik / Informatik ► Mathematik |
| ISBN-10 | 1-56881-166-7 / 1568811667 |
| ISBN-13 | 978-1-56881-166-6 / 9781568811666 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Von Logik und Mengenlehre bis Zahlen, Algebra, Graphen und …
Buch | Softcover (2024)
De Gruyter Oldenbourg (Verlag)
CHF 104,90
fundiert, vielseitig, praxisnah
Buch | Softcover (2021)
Springer Berlin (Verlag)
CHF 46,15
Analysis und Lineare Algebra mit Querverbindungen
Buch | Hardcover (2022)
Springer Spektrum (Verlag)
CHF 89,95
