Discrete Algorithmic Mathematics
โ Scribed by Stephen B Maurer, Anthony Ralston
- Publisher
- A.K.Peters/CRC
- Year
- 2005
- Tongue
- English
- Leaves
- 779
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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.
This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic p