Items related to Algorithm and Design Complexity

Algorithm and Design Complexity - Softcover

Sherine, Anli; Jasmine, Mary; Peter, Geno; Alexander, S. Albert

 
9781032409351: Algorithm and Design Complexity
Softcover
ISBN 10: 1032409355 ISBN 13: 9781032409351
Publisher: CRC Press, 2024

Synopsis

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.

"synopsis" may belong to another edition of this title.

About the Author

Anli Sherine, S. Albert Alexander

"About this title" may belong to another edition of this title.

Publisher
CRC Press
Publication date
2024
Language
English
ISBN 10 
1032409355
ISBN 13 
9781032409351
Binding
Paperback
Edition number
1
Number of pages
182