A01=Anli Sherine
A01=Geno Peter
A01=Mary Jasmine
A01=S. Albert Alexander
advanced algorithmic strategies
Age Group_Uncategorized
Age Group_Uncategorized
algorithm analysis techniques
Answer Node
asymptotic notation
Author_Anli Sherine
Author_Geno Peter
Author_Mary Jasmine
Author_S. Albert Alexander
automatic-update
Backtracking
Backtracking Algorithm
Biconnected Components
Binary Search
BST
Category1=Non-Fiction
Category=UB
Category=UMB
Category=UY
combinatorial optimization
complexity theory
computational procedures
COP=United Kingdom
Counterfeit Coin
Dead Node
Delivery_Pre-order
divide and conquer methods
Dynamic Programming
eq_bestseller
eq_computing
eq_isMigrated=2
eq_nobargain
eq_non-fiction
External Nodes
Graph
Greedy Algorithm
Halting Problem
Hamiltonian Cycle
Knapsack Problem
Knapsackproblem
Kruskal's Algorithm
Kruskal’s Algorithm
Language_English
Live Nodes
Merge Sort
Minimum Cost Path
Nondeterministic Algorithm
PA=Not yet available
Polynomial Time
Price_€50 to €100
Prim's Algorithm
Prim’s Algorithm
PS=Forthcoming
Recursive Calls
softlaunch
Spanning Tree
State Space Search
Time Space Tradeoff
Traveling Salesperson Problem
Undirected Graph
Product details
- ISBN 9781032409351
- Weight: 360g
- Dimensions: 156 x 234mm
- Publication Date: 19 Dec 2024
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Paperback
- Language: English
Secure
checkout
Fast Shipping
Easy returns
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
