Algorithm and Design Complexity

1. Auflage 2023
ISBN: 978-1-032-40932-0
Verlag: CRC Press

Buch, Englisch, 196 Seiten, Format (B × H): 161 mm x 240 mm, Gewicht: 467 g

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.

Zielgruppe

Academic and Postgraduate

Autoren/Hrsg.

Sherine, Anli

Jasmine, Mary

Peter, Geno

Alexander, S. Albert

Fachgebiete

• Mathematik | Informatik Mathematik Algebra Zahlentheorie
• Mathematik | Informatik EDV | Informatik Technische Informatik
• Technische Wissenschaften Energietechnik | Elektrotechnik Elektrotechnik

Inhaltsverzeichnis

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

Über Autor(innen)

Anli Sherine, S. Albert Alexander