Algorithm and Design Complexity
1st Edition
Published on 4. May 2023
196 pages
978-1-000-86553-0 (ISBN)
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.
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.
More details
Edition
1. Auflage
Language
English
Place of publication
London
United Kingdom
Publishing group
Taylor & Francis Ltd
Target group
College/higher education
Professional and scholarly
Product notice
Reflowable
Illustrations
2 Tables, black and white; 72 Line drawings, black and white; 72 Illustrations, black and white
ISBN-13
978-1-000-86553-0 (9781000865530)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Anli Sherine | Mary Jasmine | Geno Peter
Algorithm and Design Complexity
Book
12/2024
1st Edition
CRC Press
€71.10
Shipment within 10-20 days
Anli Sherine | Mary Jasmine | Geno Peter
Algorithm and Design Complexity
Book
05/2023
1st Edition
CRC Press
€185.80
Shipment within 10-20 days
Persons
Anli Sherine, S. Albert Alexander
Content
1. Algorithm Analysis. 2. Divide and Conquer. 3. Dynamic programming. 4. Backtracking. 5. Graph.
