Discrete Algorithmic Mathematics
Stephen B. Maurer, Anthony Ralston
Résumé
The third edition of this well-known and highly regarded text has been revised for improved clarity and streamlined to fit a one-semester course. It includes a broad variety of applications, from economics and finance to natural and social science.
New or extended discussions of:
- Order notation
- Generating functions
- Computational biology
- Chaos
- Aspects of statistics
Special features include:
- Extensive and detailed study of algorithms
- Emphasis on the recursive and inductive paradigms
- Many problems and exercises and a "hints and answers" section
Praise for previous editions of Discrete Algorithmic Mathematics:
"... More sophisticated than most discrete texts."
American Mathematical Monthly
"This interesting and well-organized book was written by two authors who are well known and respected in discrete mathennatics circles. The work is an important commentary on the continuing maturation of lower-division discrete mathematics courses."
Computing Reviews
"Thinking with and about algorithms can unify all one's mathematical endeavors. It also extends the range of one's mathematics ..., The Maurer and Ralston text does a superb job of exemplifying this theme."
College Mathematics Journal
L'auteur - Stephen B. Maurer
Stephen Maurer (B.A. Swarthmore 1967, Ph.D. Princeton 1972) is a Professor of Mathematics at Swarthmore College, where he has taught since 1979. He has also taught at the Phillips Exeter Academy, the University of Waterloo in Ontario, Princeton, Hampshire College (in their summer mathematics program for able secondary school students), and Math-Path (a national summer program for advanced middle school kids). During 2000-2003, he was Associate Provost for Information Technology at Swarthmore. His research has been in combinatorics, with forays (sometimes continuous) into mathematical biology, economics and anthropology.
Professor Maurer won the Allendoerfer expository writing award of the Mathematical Association of America for his article "The King Chicken Theorems". He has written and spoken widely on discrete mathematics and has been involved as well in the calculus reform effort. Currently he is a consultant to the Core Plus Program, one of the national high school reform curricula funded by NSF. During 1982-1984, Professor Maurer was a Program Officer at the Alfred P. Sloan Foundation, working primarily on quantitative education.
At one time or another, Maurer has been a good squash player, able to guess people's zip code to within plus or minus 5, president of the local nursery school, and president of the local swim club. His continuing hobbies include gardening, cycling, old movies, trains, dealing with two teenage sons, and badgering people with email.
L'auteur - Anthony Ralston
Anthony Ralston is Professor Emeritus of Computer Science and Mathematics at the State University of New York at Buffalo where he was from 1965 to 1995 and where he was the founding-chair of the Department of Computer Science. He is the author or editor of 16 books including a well-known early textbook on Numerical Analysis. He has been the editor or coeditor of all four editions of the Encyclopedia of Computer Science, the most recent of which was published in 2000.
Professor Ralston's S.B. and Ph.D. are both from M.I.T. in Mathematics. He began his academic career as a numerical analyst but, owing to a short attention span, at one time or another his main interest has been computer science, discrete mathematics, or mathematics education. He was President of the Association for Computing Machinery and the American Federation of Information Processing Societies. He is a Fellow of the American Association for the Advancement of Science and the Royal Society of Arts.
Ralston has lived in London since 1995. Like Maurer he is a quondam, but not good squash player. Nowadays he confines himself to tennis at which he is also riot good except perhaps on an age-related basis. He sits on the board of directors of the large apartment block in which he lives, thereby protecting his investment, and sits on various other committees. He keeps in touch with children and grandchildren by making regular trips back to the US despite the worsening ravages of jet lag.
Sommaire
- What Is Discrete Algorithmic Mathematics?
- Mathematical Preliminaries
- Algorithms
- Mathematical Induction
- Graphs and Trees
- Fundamental Counting Methods
- Difference Equations
- Probability
- An Introduction to Mathematical Logic
- Coming Full Circle with Biology and Minimax Theorems
Caractéristiques techniques
| PAPIER | |
| Éditeur(s) | AK Peters |
| Auteur(s) | Stephen B. Maurer, Anthony Ralston |
| Parution | 15/02/2005 |
| Édition | 3eme édition |
| Nb. de pages | 772 |
| Format | 19,5 x 24,5 |
| Couverture | Relié |
| Poids | 1685g |
| Intérieur | Quadri |
| EAN13 | 9781568811666 |
| ISBN13 | 978-1-56881-166-6 |
Avantages Eyrolles.com
Consultez aussi
- Les meilleures ventes en Graphisme & Photo
- Les meilleures ventes en Informatique
- Les meilleures ventes en Construction
- Les meilleures ventes en Entreprise & Droit
- Les meilleures ventes en Sciences
- Les meilleures ventes en Littérature
- Les meilleures ventes en Arts & Loisirs
- Les meilleures ventes en Vie pratique
- Les meilleures ventes en Voyage et Tourisme
- Les meilleures ventes en BD et Jeunesse
- Informatique Développement d'applications Techniques de programmation Logique
- Sciences Mathématiques Mathématiques par matières Algèbre Cours
- Sciences Mathématiques Mathématiques par matières Algèbre Exercices
- Sciences Mathématiques Mathématiques par matières Logique
- Sciences Mathématiques Mathématiques par matières Logique Logique floue
- Sciences Mathématiques Mathématiques par matières Logique Algèbre de Boole
- Sciences Mathématiques Mathématiques par matières Théorie des ensembles
- Sciences Mathématiques Mathématiques appliquées
- Sciences Etudes et concours Classes préparatoires et grandes écoles - Livres classes prépas scientifiques Mathématiques
