Résumé
Features:
- structures material by techniques employed, not by the application area, so students can progress from the underlying abstract concepts to the concrete application essentials
- begins with a compact, but complete introduction to some necessary math, and also includes a long introduction to proofs by contradiction and mathematical induction.This serves to fill the gaps that many undergraduates have in their mathematical knowledge.
- gives a paced, thorough introduction to the analysis of algorithms, and uses coherent notation and unusually detailed treatment of solving recurrences.
- includes a chapter on probabilistic algorithms and an introduction to parallel algorithms both of which are becoming increasingly important
- approaches the analysis and design of algorithms by type rather than by application.
Table of contents
- 1. Preliminaries.
- 2. Elementary Algorithmicss
- 3. Asymptotic Notation.
- 4. Analysis of Algorithms
- 5. Some Data Structures
- 6. Greedy Algorithms
- 7. Divide-And-Conquer
- 8. Dynamic Programming
- 9. Exploring Graphs
- 10. Probabilistic Algorithms
- 11. Parallel Algorithms
- 12. Computational Complexity
- 13. Heuristic and Approximate Algorithms
- References
- Index.
Caractéristiques techniques
PAPIER | |
Éditeur(s) | Prentice Hall |
Auteur(s) | Gilles Brassard, Paul Bratley |
Parution | 15/04/1995 |
Nb. de pages | 524 |
Format | 18 x 24,2 |
Couverture | Relié |
Poids | 900g |
EAN13 | 9780133350685 |
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