Algorithm and Design Complexity

Anli Sherine, Mary Jasmine, Geno Peter, S. Albert Alexander (Autoren)

Buch | Hardcover

182 Seiten

2023
CRC Press (Verlag)
978-1-032-40932-0 (ISBN)

Artikel merken

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.

Anli Sherine, S. Albert Alexander

1. Algorithm Analysis. 2. Divide and Conquer. 3. Dynamic programming. 4. Backtracking. 5. Graph.

Erscheinungsdatum	17.04.2023
Zusatzinfo	2 Tables, black and white; 72 Line drawings, black and white; 72 Illustrations, black and white
Verlagsort	London
Sprache	englisch
Maße	156 x 234 mm
Gewicht	394 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
ISBN-10	1-032-40932-0 / 1032409320
ISBN-13	978-1-032-40932-0 / 9781032409320
Zustand	Neuware