Algorithm and Design Complexity

By: and and and

Sign Up Now! Already a Member? Log In
You must be logged into Bookshare to access this title. Learn about membership options, or view our freely available titles.

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.
Copyright:
2023

Book Details

Book Quality:
Publisher Quality
ISBN-13:
9781000865530
Related ISBNs:
9781003355403, 9781032409351, 9781032409320
Publisher:
CRC Press
Date of Addition:
Copyrighted By:
Anli Sherine, Mary Jasmine, Geno Peter, and S. Albert Alexander. Reasonable efforts have been made to publish reliable data and information, but the author and publisher cannot assume responsibility for the validity of all materials or the consequences of
Adult content:
No
Language:
English
Has Image Descriptions:
No
Categories:
Nonfiction, Computers and Internet, Technology, Mathematics and Statistics
Submitted By:
Bookshare Staff
Usage Restrictions:
This is a copyrighted book.

Reviews

No Rating Yet