Titre :	Algorithm and Design Complexity
Type de document :	document électronique
Auteurs :	Sherine Anli ; Jasmine Mary ; Peter Geno
Editeur :	Boca Raton : CRC Press
Année de publication :	2023
Importance :	1 vol (181 p.)
ISBN/ISSN/EAN :	978-1-00-086551-6
Langues :	Français (fre)
Catégories :	Bibliothèque numérique:Informatique
Mots-clés :	Computer algorithms Computational complexity
Index. décimale :	004 Informatique
Résumé :	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.
Note de contenu :	TABLE OF CONTENTS chapter 1 Algorithm Analysis chapter 2 Divide and Conquer chapter 3 Dynamic Programming chapter 4 Backtracking chapter 5 Graph
Côte titre :	E-Fs/0038
En ligne :	https://sciences-courses.univ-setif.dz/login/index.php

Algorithm and Design Complexity [document électronique] / Sherine Anli ; Jasmine Mary ; Peter Geno . - Boca Raton : CRC Press, 2023 . - 1 vol (181 p.).
ISBN : 978-1-00-086551-6
Langues : Français (fre)

Catégories :	Bibliothèque numérique:Informatique
Mots-clés :	Computer algorithms Computational complexity
Index. décimale :	004 Informatique
Résumé :	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.
Note de contenu :	TABLE OF CONTENTS chapter 1 Algorithm Analysis chapter 2 Divide and Conquer chapter 3 Dynamic Programming chapter 4 Backtracking chapter 5 Graph
Côte titre :	E-Fs/0038
En ligne :	https://sciences-courses.univ-setif.dz/login/index.php