Algorithm and Design Complexity - Couverture souple

Sherine, Anli; Jasmine, Mary; Peter, Geno; Alexander, S. Albert

Couverture souple

ISBN 10 : 1032409355 ISBN 13 : 9781032409351

Editeur : CRC Press, 2024

Synopsis

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.

A propos du livre

À propos de l'auteur

Anli Sherine, S. Albert Alexander

À propos de la quatrième de couverture

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.

Détails de l'édition

• Éditeur: CRC Press
• Date d'édition: 2024
• Langue: anglais
• ISBN 10: 1032409355
• ISBN 13: 9781032409351
• Reliure: Broché
• Nombre de pages: 196
• Coordonnées du fabricant: non disponible
• Personne responsable: gpsr@libri.de; gpsr@libri.de; ; Europaallee 1; Bad Hersfeld; 36244; Allemagne