- Retrait gratuit dans votre magasin Club
- 7.000.000 titres dans notre catalogue
- Payer en toute sécurité
- Toujours un magasin près de chez vous
- Retrait gratuit dans votre magasin Club
- 7.000.000 titres dans notre catalogue
- Payer en toute sécurité
- Toujours un magasin près de chez vous
Algorithm and Design Complexity
Anli Sherine, Mary Jasmine, Geno Peter, S Albert Alexander
Livre relié | Anglais
228,95 €
+ 457 points
Description
Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. Algorithm and Design Complexity initiates with discussion of algorithm analysis, time-space trade-off, symptotic notations, and so forth. It further includes algorithms that are definite and effective, known as computational procedures. Further topics explored include divide-and-conquer, dynamic programming, and backtracking.
Features:
- Includes complete coverage of basics and design of algorithms
- Discusses algorithm analysis techniques like divide-and-conquer, dynamic programming, and greedy heuristics
- Provides time and space complexity tutorials
- Reviews combinatorial optimization of Knapsack problem
- Simplifies recurrence relation for time complexity
This book is aimed at graduate students and researchers in computers science, information technology, and electrical engineering.
Spécifications
Parties prenantes
- Auteur(s) :
- Editeur:
Contenu
- Nombre de pages :
- 182
- Langue:
- Anglais
Caractéristiques
- EAN:
- 9781032409320
- Date de parution :
- 04-05-23
- Format:
- Livre relié
- Format numérique:
- Genaaid
- Dimensions :
- 156 mm x 234 mm
- Poids :
- 453 g
