Discrete Algorithmic Mathematics
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.show more
- Hardback | 803 pages
- 200 x 248 x 50mm | 1,719.13g
- 21 Jan 2005
- Taylor & Francis Inc
- A K Peters
- Natick, United States
- 3rd Revised edition
- Illustrations (some col.)
We're sure it's not your fault and would like to ask you to try again.
Alternatively, just visit our homepage or navigate to an interesting page by using the links below.
Should you wish to contact customer services regarding this matter, please use our online contact form or visit our Help section.