Description - Discrete Algorithmic Mathematics by Stephen B. Maurer
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. To request a copy of the complete solutions contact Susannah Sieper at 303-817-1996 or email firstname.lastname@example.org. The authors have created an Errata sheet, which they update periodically.
Selected excerpts are available for evaluation: - Contents - Instructor's Preface - Chapter Summaries - Recursive Algorithms - Induction and Recursive Algorithms - Shortest Paths - Combinatorial Identities and Combinatorial Arguments
Buy Discrete Algorithmic Mathematics by Stephen B. Maurer from Australia's Online Independent Bookstore, Boomerang Books.
(241mm x 191mm x 51mm)
A K Peters
Publisher: Taylor & Francis Inc
Country of Publication:
Other Editions - Discrete Algorithmic Mathematics by Stephen B. Maurer
Book Reviews - Discrete Algorithmic Mathematics by Stephen B. Maurer
Author Biography - Stephen B. Maurer
Stephen B Maurer (Ph.D. Princeton 1972) is a Professor of Mathematics at Swarthmore College and winner of the Allendoerfer Award for expository writing. Anthony Ralston (Ph.D. MIT 1956) is Professor Emeritus of Computer Science and Mathematics at SUNY Buffalo. He is a former President of the ACM.